./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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/safe030_power.opt_pso.opt_rmo.opt.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 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 16:38:22,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 16:38:22,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 16:38:22,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 16:38:22,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 16:38:22,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 16:38:22,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 16:38:22,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 16:38:22,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 16:38:22,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 16:38:22,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 16:38:22,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 16:38:22,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 16:38:22,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 16:38:22,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 16:38:22,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 16:38:22,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 16:38:22,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 16:38:22,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 16:38:22,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 16:38:22,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 16:38:22,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 16:38:22,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 16:38:22,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 16:38:22,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 16:38:22,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 16:38:22,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 16:38:22,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 16:38:22,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 16:38:22,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 16:38:22,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 16:38:22,394 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 16:38:22,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 16:38:22,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 16:38:22,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 16:38:22,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 16:38:22,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 16:38:22,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 16:38:22,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 16:38:22,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 16:38:22,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 16:38:22,399 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 16:38:22,426 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 16:38:22,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 16:38:22,431 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 16:38:22,431 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 16:38:22,432 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 16:38:22,432 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 16:38:22,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 16:38:22,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 16:38:22,433 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 16:38:22,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 16:38:22,433 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 16:38:22,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 16:38:22,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 16:38:22,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 16:38:22,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 16:38:22,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 16:38:22,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 16:38:22,434 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 16:38:22,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 16:38:22,435 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 16:38:22,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 16:38:22,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 16:38:22,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 16:38:22,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 16:38:22,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:38:22,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 16:38:22,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 16:38:22,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 16:38:22,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 16:38:22,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 16:38:22,437 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 16:38:22,437 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 16:38:22,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 16:38:22,438 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 16:38:22,438 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 -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 [2021-12-14 16:38:22,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 16:38:22,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 16:38:22,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 16:38:22,637 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 16:38:22,637 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 16:38:22,638 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2021-12-14 16:38:22,691 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9535832e/f5a44128b90a4fd28a7fe4e6223475a6/FLAGa255fba5d [2021-12-14 16:38:23,134 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 16:38:23,147 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2021-12-14 16:38:23,161 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9535832e/f5a44128b90a4fd28a7fe4e6223475a6/FLAGa255fba5d [2021-12-14 16:38:23,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9535832e/f5a44128b90a4fd28a7fe4e6223475a6 [2021-12-14 16:38:23,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 16:38:23,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 16:38:23,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 16:38:23,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 16:38:23,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 16:38:23,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:38:23" (1/1) ... [2021-12-14 16:38:23,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5563db1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:23, skipping insertion in model container [2021-12-14 16:38:23,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:38:23" (1/1) ... [2021-12-14 16:38:23,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 16:38:23,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 16:38:23,678 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2021-12-14 16:38:23,775 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:38:23,787 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 16:38:23,799 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2021-12-14 16:38:23,842 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:38:23,869 INFO L208 MainTranslator]: Completed translation [2021-12-14 16:38:23,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:23 WrapperNode [2021-12-14 16:38:23,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 16:38:23,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 16:38:23,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 16:38:23,871 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 16:38:23,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:23" (1/1) ... [2021-12-14 16:38:23,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:23" (1/1) ... [2021-12-14 16:38:23,914 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 273 [2021-12-14 16:38:23,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 16:38:23,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 16:38:23,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 16:38:23,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 16:38:23,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:23" (1/1) ... [2021-12-14 16:38:23,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:23" (1/1) ... [2021-12-14 16:38:23,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:23" (1/1) ... [2021-12-14 16:38:23,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:23" (1/1) ... [2021-12-14 16:38:23,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:23" (1/1) ... [2021-12-14 16:38:23,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:23" (1/1) ... [2021-12-14 16:38:23,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:23" (1/1) ... [2021-12-14 16:38:23,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 16:38:23,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 16:38:23,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 16:38:23,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 16:38:23,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:23" (1/1) ... [2021-12-14 16:38:23,974 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:38:23,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:38:24,013 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) [2021-12-14 16:38:24,031 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 [2021-12-14 16:38:24,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 16:38:24,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-14 16:38:24,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 16:38:24,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 16:38:24,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 16:38:24,047 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-14 16:38:24,048 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-14 16:38:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-14 16:38:24,048 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-14 16:38:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-14 16:38:24,048 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-14 16:38:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 16:38:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-14 16:38:24,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 16:38:24,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 16:38:24,050 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-14 16:38:24,165 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 16:38:24,166 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 16:38:24,509 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 16:38:24,741 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 16:38:24,741 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-14 16:38:24,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:38:24 BoogieIcfgContainer [2021-12-14 16:38:24,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 16:38:24,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 16:38:24,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 16:38:24,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 16:38:24,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:38:23" (1/3) ... [2021-12-14 16:38:24,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@925cd0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:38:24, skipping insertion in model container [2021-12-14 16:38:24,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:38:23" (2/3) ... [2021-12-14 16:38:24,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@925cd0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:38:24, skipping insertion in model container [2021-12-14 16:38:24,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:38:24" (3/3) ... [2021-12-14 16:38:24,749 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2021-12-14 16:38:24,753 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-14 16:38:24,753 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 16:38:24,753 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-14 16:38:24,753 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-14 16:38:24,782 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,783 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,783 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,783 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,783 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,784 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,784 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,784 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,784 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,785 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,785 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,785 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,786 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,786 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,786 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,786 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,786 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,786 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,787 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,787 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,787 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,788 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,788 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,788 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,788 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,788 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,788 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,789 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,789 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,789 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,789 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,789 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,789 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,789 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,790 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,790 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,790 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,790 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,790 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,791 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,791 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,791 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,791 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,791 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,791 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,791 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,792 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,792 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,792 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,792 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,792 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,792 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,793 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,793 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,793 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,793 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,793 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,793 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,793 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,793 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,796 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,818 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,819 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,819 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,819 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,819 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,819 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,820 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,820 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,822 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,823 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,824 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,824 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,825 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,825 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,825 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,825 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,825 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,830 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,830 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,830 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,830 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,830 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,831 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,831 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,831 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,831 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:38:24,831 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-14 16:38:24,870 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 16:38:24,876 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 16:38:24,877 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-14 16:38:24,887 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2021-12-14 16:38:24,936 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2021-12-14 16:38:24,937 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-14 16:38:24,939 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2021-12-14 16:38:24,939 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2021-12-14 16:38:24,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2021-12-14 16:38:24,957 INFO L129 PetriNetUnfolder]: 0/72 cut-off events. [2021-12-14 16:38:24,957 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-14 16:38:24,957 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:24,958 INFO L254 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] [2021-12-14 16:38:24,958 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:38:24,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:24,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2040665683, now seen corresponding path program 1 times [2021-12-14 16:38:24,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:24,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691666719] [2021-12-14 16:38:24,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:24,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:38:25,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:25,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691666719] [2021-12-14 16:38:25,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691666719] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:25,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:25,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 16:38:25,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4343760] [2021-12-14 16:38:25,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:25,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:38:25,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:25,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:38:25,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 16:38:25,236 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 112 [2021-12-14 16:38:25,240 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:25,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:25,241 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 112 [2021-12-14 16:38:25,241 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:25,359 INFO L129 PetriNetUnfolder]: 17/241 cut-off events. [2021-12-14 16:38:25,360 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-14 16:38:25,361 INFO L84 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 241 events. 17/241 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 751 event pairs, 7 based on Foata normal form. 8/237 useless extension candidates. Maximal degree in co-relation 243. Up to 27 conditions per place. [2021-12-14 16:38:25,363 INFO L132 encePairwiseOnDemand]: 107/112 looper letters, 10 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2021-12-14 16:38:25,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 108 transitions, 249 flow [2021-12-14 16:38:25,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:38:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-14 16:38:25,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2021-12-14 16:38:25,376 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9345238095238095 [2021-12-14 16:38:25,376 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2021-12-14 16:38:25,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2021-12-14 16:38:25,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:25,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2021-12-14 16:38:25,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:25,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:25,392 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:25,393 INFO L186 Difference]: Start difference. First operand has 117 places, 109 transitions, 227 flow. Second operand 3 states and 314 transitions. [2021-12-14 16:38:25,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 108 transitions, 249 flow [2021-12-14 16:38:25,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 108 transitions, 246 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-14 16:38:25,398 INFO L242 Difference]: Finished difference. Result has 114 places, 105 transitions, 220 flow [2021-12-14 16:38:25,399 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2021-12-14 16:38:25,401 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places. [2021-12-14 16:38:25,402 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 220 flow [2021-12-14 16:38:25,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:25,402 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:25,402 INFO L254 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] [2021-12-14 16:38:25,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 16:38:25,403 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:38:25,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:25,403 INFO L85 PathProgramCache]: Analyzing trace with hash -690634123, now seen corresponding path program 1 times [2021-12-14 16:38:25,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:25,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207679125] [2021-12-14 16:38:25,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:25,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:38:25,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:25,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207679125] [2021-12-14 16:38:25,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207679125] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:25,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:25,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:38:25,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492112549] [2021-12-14 16:38:25,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:25,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:38:25,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:25,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:38:25,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:38:25,561 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2021-12-14 16:38:25,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:25,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:25,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2021-12-14 16:38:25,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:25,821 INFO L129 PetriNetUnfolder]: 282/963 cut-off events. [2021-12-14 16:38:25,821 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-12-14 16:38:25,824 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 963 events. 282/963 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6343 event pairs, 42 based on Foata normal form. 0/935 useless extension candidates. Maximal degree in co-relation 1445. Up to 249 conditions per place. [2021-12-14 16:38:25,826 INFO L132 encePairwiseOnDemand]: 105/112 looper letters, 20 selfloop transitions, 3 changer transitions 48/148 dead transitions. [2021-12-14 16:38:25,826 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 148 transitions, 444 flow [2021-12-14 16:38:25,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 16:38:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-14 16:38:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions. [2021-12-14 16:38:25,829 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8740079365079365 [2021-12-14 16:38:25,829 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 881 transitions. [2021-12-14 16:38:25,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 881 transitions. [2021-12-14 16:38:25,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:25,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 881 transitions. [2021-12-14 16:38:25,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.88888888888889) internal successors, (881), 9 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:25,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:25,834 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:25,835 INFO L186 Difference]: Start difference. First operand has 114 places, 105 transitions, 220 flow. Second operand 9 states and 881 transitions. [2021-12-14 16:38:25,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 148 transitions, 444 flow [2021-12-14 16:38:25,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 148 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-14 16:38:25,837 INFO L242 Difference]: Finished difference. Result has 127 places, 95 transitions, 235 flow [2021-12-14 16:38:25,838 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=235, PETRI_PLACES=127, PETRI_TRANSITIONS=95} [2021-12-14 16:38:25,838 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 10 predicate places. [2021-12-14 16:38:25,838 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 95 transitions, 235 flow [2021-12-14 16:38:25,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:25,839 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:25,839 INFO L254 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] [2021-12-14 16:38:25,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 16:38:25,840 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:38:25,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:25,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1140221050, now seen corresponding path program 1 times [2021-12-14 16:38:25,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:25,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813958579] [2021-12-14 16:38:25,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:25,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:25,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:38:25,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:25,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813958579] [2021-12-14 16:38:25,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813958579] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:25,973 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:25,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:38:25,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472624] [2021-12-14 16:38:25,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:25,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:38:25,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:25,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:38:25,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:38:25,975 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2021-12-14 16:38:25,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 95 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:25,975 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:25,975 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2021-12-14 16:38:25,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:26,233 INFO L129 PetriNetUnfolder]: 466/1063 cut-off events. [2021-12-14 16:38:26,234 INFO L130 PetriNetUnfolder]: For 760/760 co-relation queries the response was YES. [2021-12-14 16:38:26,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2396 conditions, 1063 events. 466/1063 cut-off events. For 760/760 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6122 event pairs, 202 based on Foata normal form. 30/1068 useless extension candidates. Maximal degree in co-relation 2339. Up to 393 conditions per place. [2021-12-14 16:38:26,241 INFO L132 encePairwiseOnDemand]: 105/112 looper letters, 20 selfloop transitions, 3 changer transitions 34/136 dead transitions. [2021-12-14 16:38:26,241 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 136 transitions, 453 flow [2021-12-14 16:38:26,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 16:38:26,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-14 16:38:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 878 transitions. [2021-12-14 16:38:26,244 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.871031746031746 [2021-12-14 16:38:26,244 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 878 transitions. [2021-12-14 16:38:26,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 878 transitions. [2021-12-14 16:38:26,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:26,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 878 transitions. [2021-12-14 16:38:26,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.55555555555556) internal successors, (878), 9 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:26,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:26,247 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:26,247 INFO L186 Difference]: Start difference. First operand has 127 places, 95 transitions, 235 flow. Second operand 9 states and 878 transitions. [2021-12-14 16:38:26,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 136 transitions, 453 flow [2021-12-14 16:38:26,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 136 transitions, 436 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-12-14 16:38:26,257 INFO L242 Difference]: Finished difference. Result has 120 places, 97 transitions, 269 flow [2021-12-14 16:38:26,257 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=105, 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=269, PETRI_PLACES=120, PETRI_TRANSITIONS=97} [2021-12-14 16:38:26,258 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 3 predicate places. [2021-12-14 16:38:26,258 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 97 transitions, 269 flow [2021-12-14 16:38:26,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:26,259 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:26,259 INFO L254 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] [2021-12-14 16:38:26,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 16:38:26,259 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:38:26,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:26,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1834518823, now seen corresponding path program 1 times [2021-12-14 16:38:26,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:26,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927288966] [2021-12-14 16:38:26,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:26,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:38:26,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:26,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927288966] [2021-12-14 16:38:26,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927288966] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:26,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:26,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:38:26,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624231948] [2021-12-14 16:38:26,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:26,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:38:26,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:26,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:38:26,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:38:26,410 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2021-12-14 16:38:26,410 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 97 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:26,410 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:26,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2021-12-14 16:38:26,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:26,698 INFO L129 PetriNetUnfolder]: 380/986 cut-off events. [2021-12-14 16:38:26,699 INFO L130 PetriNetUnfolder]: For 1656/1672 co-relation queries the response was YES. [2021-12-14 16:38:26,705 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2694 conditions, 986 events. 380/986 cut-off events. For 1656/1672 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5965 event pairs, 175 based on Foata normal form. 20/976 useless extension candidates. Maximal degree in co-relation 2632. Up to 286 conditions per place. [2021-12-14 16:38:26,709 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 25 selfloop transitions, 3 changer transitions 28/135 dead transitions. [2021-12-14 16:38:26,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 135 transitions, 531 flow [2021-12-14 16:38:26,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 16:38:26,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-14 16:38:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 876 transitions. [2021-12-14 16:38:26,712 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8690476190476191 [2021-12-14 16:38:26,712 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 876 transitions. [2021-12-14 16:38:26,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 876 transitions. [2021-12-14 16:38:26,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:26,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 876 transitions. [2021-12-14 16:38:26,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.33333333333333) internal successors, (876), 9 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:26,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:26,717 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:26,717 INFO L186 Difference]: Start difference. First operand has 120 places, 97 transitions, 269 flow. Second operand 9 states and 876 transitions. [2021-12-14 16:38:26,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 135 transitions, 531 flow [2021-12-14 16:38:26,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 135 transitions, 500 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-12-14 16:38:26,725 INFO L242 Difference]: Finished difference. Result has 125 places, 97 transitions, 281 flow [2021-12-14 16:38:26,725 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=281, PETRI_PLACES=125, PETRI_TRANSITIONS=97} [2021-12-14 16:38:26,726 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places. [2021-12-14 16:38:26,726 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 97 transitions, 281 flow [2021-12-14 16:38:26,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:26,726 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:26,727 INFO L254 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] [2021-12-14 16:38:26,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 16:38:26,727 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:38:26,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:26,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1187014733, now seen corresponding path program 1 times [2021-12-14 16:38:26,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:26,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206424964] [2021-12-14 16:38:26,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:26,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:26,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:38:26,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:26,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206424964] [2021-12-14 16:38:26,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206424964] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:26,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:26,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 16:38:26,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880791067] [2021-12-14 16:38:26,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:26,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 16:38:26,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:26,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 16:38:26,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-14 16:38:26,901 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2021-12-14 16:38:26,902 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 97 transitions, 281 flow. Second operand has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:26,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:26,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2021-12-14 16:38:26,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:27,282 INFO L129 PetriNetUnfolder]: 403/1183 cut-off events. [2021-12-14 16:38:27,283 INFO L130 PetriNetUnfolder]: For 3294/3326 co-relation queries the response was YES. [2021-12-14 16:38:27,288 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3288 conditions, 1183 events. 403/1183 cut-off events. For 3294/3326 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8273 event pairs, 215 based on Foata normal form. 42/1150 useless extension candidates. Maximal degree in co-relation 3219. Up to 344 conditions per place. [2021-12-14 16:38:27,291 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 17 selfloop transitions, 8 changer transitions 35/139 dead transitions. [2021-12-14 16:38:27,291 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 139 transitions, 547 flow [2021-12-14 16:38:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 16:38:27,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-14 16:38:27,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1398 transitions. [2021-12-14 16:38:27,294 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8321428571428572 [2021-12-14 16:38:27,294 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1398 transitions. [2021-12-14 16:38:27,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1398 transitions. [2021-12-14 16:38:27,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:27,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1398 transitions. [2021-12-14 16:38:27,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 93.2) internal successors, (1398), 15 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:27,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:27,300 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:27,300 INFO L186 Difference]: Start difference. First operand has 125 places, 97 transitions, 281 flow. Second operand 15 states and 1398 transitions. [2021-12-14 16:38:27,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 139 transitions, 547 flow [2021-12-14 16:38:27,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 139 transitions, 502 flow, removed 21 selfloop flow, removed 7 redundant places. [2021-12-14 16:38:27,307 INFO L242 Difference]: Finished difference. Result has 137 places, 101 transitions, 332 flow [2021-12-14 16:38:27,307 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=332, PETRI_PLACES=137, PETRI_TRANSITIONS=101} [2021-12-14 16:38:27,309 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 20 predicate places. [2021-12-14 16:38:27,309 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 101 transitions, 332 flow [2021-12-14 16:38:27,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:27,310 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:27,310 INFO L254 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] [2021-12-14 16:38:27,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 16:38:27,310 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:38:27,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:27,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1460208508, now seen corresponding path program 1 times [2021-12-14 16:38:27,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:27,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907624674] [2021-12-14 16:38:27,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:27,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:27,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:38:27,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:27,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907624674] [2021-12-14 16:38:27,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907624674] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:27,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:27,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 16:38:27,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658970482] [2021-12-14 16:38:27,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:27,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 16:38:27,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:27,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 16:38:27,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-14 16:38:27,498 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2021-12-14 16:38:27,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 101 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:27,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:27,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2021-12-14 16:38:27,499 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:27,828 INFO L129 PetriNetUnfolder]: 286/869 cut-off events. [2021-12-14 16:38:27,828 INFO L130 PetriNetUnfolder]: For 3694/3708 co-relation queries the response was YES. [2021-12-14 16:38:27,833 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3086 conditions, 869 events. 286/869 cut-off events. For 3694/3708 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5585 event pairs, 116 based on Foata normal form. 24/820 useless extension candidates. Maximal degree in co-relation 3007. Up to 286 conditions per place. [2021-12-14 16:38:27,836 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 24 selfloop transitions, 8 changer transitions 25/136 dead transitions. [2021-12-14 16:38:27,839 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 136 transitions, 708 flow [2021-12-14 16:38:27,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 16:38:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-14 16:38:27,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1392 transitions. [2021-12-14 16:38:27,842 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2021-12-14 16:38:27,842 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1392 transitions. [2021-12-14 16:38:27,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1392 transitions. [2021-12-14 16:38:27,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:27,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1392 transitions. [2021-12-14 16:38:27,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 92.8) internal successors, (1392), 15 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:27,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:27,849 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:27,849 INFO L186 Difference]: Start difference. First operand has 137 places, 101 transitions, 332 flow. Second operand 15 states and 1392 transitions. [2021-12-14 16:38:27,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 136 transitions, 708 flow [2021-12-14 16:38:27,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 136 transitions, 680 flow, removed 12 selfloop flow, removed 5 redundant places. [2021-12-14 16:38:27,855 INFO L242 Difference]: Finished difference. Result has 147 places, 103 transitions, 381 flow [2021-12-14 16:38:27,855 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=381, PETRI_PLACES=147, PETRI_TRANSITIONS=103} [2021-12-14 16:38:27,857 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 30 predicate places. [2021-12-14 16:38:27,858 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 103 transitions, 381 flow [2021-12-14 16:38:27,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.5) internal successors, (905), 10 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:27,858 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:27,858 INFO L254 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] [2021-12-14 16:38:27,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 16:38:27,859 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:38:27,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:27,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1319428366, now seen corresponding path program 1 times [2021-12-14 16:38:27,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:27,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852787682] [2021-12-14 16:38:27,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:27,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:28,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:38:28,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:28,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852787682] [2021-12-14 16:38:28,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852787682] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:28,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:28,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-14 16:38:28,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566269587] [2021-12-14 16:38:28,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:28,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 16:38:28,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:28,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 16:38:28,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-12-14 16:38:28,128 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 112 [2021-12-14 16:38:28,128 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 103 transitions, 381 flow. Second operand has 13 states, 13 states have (on average 88.38461538461539) internal successors, (1149), 13 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:28,128 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:28,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 112 [2021-12-14 16:38:28,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:28,405 INFO L129 PetriNetUnfolder]: 221/728 cut-off events. [2021-12-14 16:38:28,406 INFO L130 PetriNetUnfolder]: For 4841/4852 co-relation queries the response was YES. [2021-12-14 16:38:28,418 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2987 conditions, 728 events. 221/728 cut-off events. For 4841/4852 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4376 event pairs, 83 based on Foata normal form. 12/696 useless extension candidates. Maximal degree in co-relation 2897. Up to 267 conditions per place. [2021-12-14 16:38:28,421 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 20 selfloop transitions, 9 changer transitions 13/119 dead transitions. [2021-12-14 16:38:28,421 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 119 transitions, 621 flow [2021-12-14 16:38:28,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 16:38:28,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-14 16:38:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1259 transitions. [2021-12-14 16:38:28,424 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8029336734693877 [2021-12-14 16:38:28,424 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1259 transitions. [2021-12-14 16:38:28,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1259 transitions. [2021-12-14 16:38:28,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:28,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1259 transitions. [2021-12-14 16:38:28,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 89.92857142857143) internal successors, (1259), 14 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:28,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:28,429 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:28,429 INFO L186 Difference]: Start difference. First operand has 147 places, 103 transitions, 381 flow. Second operand 14 states and 1259 transitions. [2021-12-14 16:38:28,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 119 transitions, 621 flow [2021-12-14 16:38:28,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 119 transitions, 566 flow, removed 22 selfloop flow, removed 9 redundant places. [2021-12-14 16:38:28,436 INFO L242 Difference]: Finished difference. Result has 149 places, 103 transitions, 386 flow [2021-12-14 16:38:28,436 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=386, PETRI_PLACES=149, PETRI_TRANSITIONS=103} [2021-12-14 16:38:28,437 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 32 predicate places. [2021-12-14 16:38:28,437 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 103 transitions, 386 flow [2021-12-14 16:38:28,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 88.38461538461539) internal successors, (1149), 13 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:28,438 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:28,438 INFO L254 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] [2021-12-14 16:38:28,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 16:38:28,438 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:38:28,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:28,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1893806608, now seen corresponding path program 1 times [2021-12-14 16:38:28,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:28,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158651467] [2021-12-14 16:38:28,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:28,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:38:28,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:28,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158651467] [2021-12-14 16:38:28,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158651467] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:28,527 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:28,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:38:28,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712523982] [2021-12-14 16:38:28,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:28,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:38:28,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:28,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:38:28,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:38:28,529 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2021-12-14 16:38:28,529 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 103 transitions, 386 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:28,529 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:28,529 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2021-12-14 16:38:28,529 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:28,808 INFO L129 PetriNetUnfolder]: 351/1198 cut-off events. [2021-12-14 16:38:28,809 INFO L130 PetriNetUnfolder]: For 8328/8361 co-relation queries the response was YES. [2021-12-14 16:38:28,815 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4945 conditions, 1198 events. 351/1198 cut-off events. For 8328/8361 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8672 event pairs, 127 based on Foata normal form. 40/1170 useless extension candidates. Maximal degree in co-relation 4856. Up to 253 conditions per place. [2021-12-14 16:38:28,819 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 29 selfloop transitions, 11 changer transitions 12/133 dead transitions. [2021-12-14 16:38:28,819 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 133 transitions, 801 flow [2021-12-14 16:38:28,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 16:38:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-14 16:38:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 867 transitions. [2021-12-14 16:38:28,821 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8601190476190477 [2021-12-14 16:38:28,822 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 867 transitions. [2021-12-14 16:38:28,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 867 transitions. [2021-12-14 16:38:28,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:28,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 867 transitions. [2021-12-14 16:38:28,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.33333333333333) internal successors, (867), 9 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:28,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:28,825 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:28,825 INFO L186 Difference]: Start difference. First operand has 149 places, 103 transitions, 386 flow. Second operand 9 states and 867 transitions. [2021-12-14 16:38:28,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 133 transitions, 801 flow [2021-12-14 16:38:28,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 133 transitions, 712 flow, removed 37 selfloop flow, removed 15 redundant places. [2021-12-14 16:38:28,836 INFO L242 Difference]: Finished difference. Result has 143 places, 111 transitions, 480 flow [2021-12-14 16:38:28,836 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=480, PETRI_PLACES=143, PETRI_TRANSITIONS=111} [2021-12-14 16:38:28,837 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 26 predicate places. [2021-12-14 16:38:28,837 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 111 transitions, 480 flow [2021-12-14 16:38:28,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:28,837 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:28,837 INFO L254 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] [2021-12-14 16:38:28,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 16:38:28,837 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:38:28,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:28,838 INFO L85 PathProgramCache]: Analyzing trace with hash -769572296, now seen corresponding path program 1 times [2021-12-14 16:38:28,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:28,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576466408] [2021-12-14 16:38:28,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:28,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:38:28,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:28,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576466408] [2021-12-14 16:38:28,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576466408] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:28,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:28,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 16:38:28,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986529928] [2021-12-14 16:38:28,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:28,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:38:28,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:28,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:38:28,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:38:28,983 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2021-12-14 16:38:28,984 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 111 transitions, 480 flow. Second operand has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:28,984 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:28,984 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2021-12-14 16:38:28,984 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:29,314 INFO L129 PetriNetUnfolder]: 496/1551 cut-off events. [2021-12-14 16:38:29,314 INFO L130 PetriNetUnfolder]: For 10702/10829 co-relation queries the response was YES. [2021-12-14 16:38:29,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6723 conditions, 1551 events. 496/1551 cut-off events. For 10702/10829 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 12482 event pairs, 194 based on Foata normal form. 27/1460 useless extension candidates. Maximal degree in co-relation 6638. Up to 527 conditions per place. [2021-12-14 16:38:29,325 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 21 selfloop transitions, 11 changer transitions 36/147 dead transitions. [2021-12-14 16:38:29,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 147 transitions, 981 flow [2021-12-14 16:38:29,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 16:38:29,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-14 16:38:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1117 transitions. [2021-12-14 16:38:29,327 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8311011904761905 [2021-12-14 16:38:29,327 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1117 transitions. [2021-12-14 16:38:29,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1117 transitions. [2021-12-14 16:38:29,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:29,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1117 transitions. [2021-12-14 16:38:29,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 93.08333333333333) internal successors, (1117), 12 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:29,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:29,332 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:29,332 INFO L186 Difference]: Start difference. First operand has 143 places, 111 transitions, 480 flow. Second operand 12 states and 1117 transitions. [2021-12-14 16:38:29,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 147 transitions, 981 flow [2021-12-14 16:38:29,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 147 transitions, 922 flow, removed 28 selfloop flow, removed 1 redundant places. [2021-12-14 16:38:29,352 INFO L242 Difference]: Finished difference. Result has 161 places, 108 transitions, 459 flow [2021-12-14 16:38:29,353 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=459, PETRI_PLACES=161, PETRI_TRANSITIONS=108} [2021-12-14 16:38:29,353 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 44 predicate places. [2021-12-14 16:38:29,353 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 108 transitions, 459 flow [2021-12-14 16:38:29,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:29,354 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:29,354 INFO L254 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] [2021-12-14 16:38:29,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 16:38:29,354 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:38:29,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:29,354 INFO L85 PathProgramCache]: Analyzing trace with hash 497941154, now seen corresponding path program 2 times [2021-12-14 16:38:29,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:29,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561143133] [2021-12-14 16:38:29,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:29,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:38:29,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:29,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561143133] [2021-12-14 16:38:29,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561143133] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:29,526 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:29,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 16:38:29,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600454559] [2021-12-14 16:38:29,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:29,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 16:38:29,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:29,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 16:38:29,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:38:29,529 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2021-12-14 16:38:29,530 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 108 transitions, 459 flow. Second operand has 11 states, 11 states have (on average 89.54545454545455) internal successors, (985), 11 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:29,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:29,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2021-12-14 16:38:29,530 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:29,850 INFO L129 PetriNetUnfolder]: 292/1035 cut-off events. [2021-12-14 16:38:29,850 INFO L130 PetriNetUnfolder]: For 12184/12343 co-relation queries the response was YES. [2021-12-14 16:38:29,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5365 conditions, 1035 events. 292/1035 cut-off events. For 12184/12343 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7522 event pairs, 129 based on Foata normal form. 31/978 useless extension candidates. Maximal degree in co-relation 5269. Up to 342 conditions per place. [2021-12-14 16:38:29,860 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 21 selfloop transitions, 14 changer transitions 19/132 dead transitions. [2021-12-14 16:38:29,860 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 132 transitions, 927 flow [2021-12-14 16:38:29,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 16:38:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-14 16:38:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1193 transitions. [2021-12-14 16:38:29,863 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8193681318681318 [2021-12-14 16:38:29,863 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1193 transitions. [2021-12-14 16:38:29,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1193 transitions. [2021-12-14 16:38:29,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:29,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1193 transitions. [2021-12-14 16:38:29,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 91.76923076923077) internal successors, (1193), 13 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:29,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:29,869 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:29,869 INFO L186 Difference]: Start difference. First operand has 161 places, 108 transitions, 459 flow. Second operand 13 states and 1193 transitions. [2021-12-14 16:38:29,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 132 transitions, 927 flow [2021-12-14 16:38:29,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 132 transitions, 857 flow, removed 31 selfloop flow, removed 11 redundant places. [2021-12-14 16:38:29,883 INFO L242 Difference]: Finished difference. Result has 157 places, 110 transitions, 513 flow [2021-12-14 16:38:29,884 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=513, PETRI_PLACES=157, PETRI_TRANSITIONS=110} [2021-12-14 16:38:29,885 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 40 predicate places. [2021-12-14 16:38:29,885 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 110 transitions, 513 flow [2021-12-14 16:38:29,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.54545454545455) internal successors, (985), 11 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:29,885 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:29,885 INFO L254 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] [2021-12-14 16:38:29,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 16:38:29,886 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:38:29,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:29,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1422999360, now seen corresponding path program 3 times [2021-12-14 16:38:29,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:29,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114341068] [2021-12-14 16:38:29,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:29,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:38:30,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:30,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114341068] [2021-12-14 16:38:30,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114341068] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:30,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:30,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 16:38:30,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103807310] [2021-12-14 16:38:30,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:30,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:38:30,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:30,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:38:30,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:38:30,039 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2021-12-14 16:38:30,040 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 110 transitions, 513 flow. Second operand has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:30,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:30,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2021-12-14 16:38:30,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:30,366 INFO L129 PetriNetUnfolder]: 279/1059 cut-off events. [2021-12-14 16:38:30,366 INFO L130 PetriNetUnfolder]: For 17723/17931 co-relation queries the response was YES. [2021-12-14 16:38:30,371 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6056 conditions, 1059 events. 279/1059 cut-off events. For 17723/17931 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8084 event pairs, 82 based on Foata normal form. 53/1020 useless extension candidates. Maximal degree in co-relation 5961. Up to 271 conditions per place. [2021-12-14 16:38:30,376 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 25 selfloop transitions, 16 changer transitions 19/139 dead transitions. [2021-12-14 16:38:30,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 139 transitions, 1153 flow [2021-12-14 16:38:30,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 16:38:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-14 16:38:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1298 transitions. [2021-12-14 16:38:30,378 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8278061224489796 [2021-12-14 16:38:30,378 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1298 transitions. [2021-12-14 16:38:30,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1298 transitions. [2021-12-14 16:38:30,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:30,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1298 transitions. [2021-12-14 16:38:30,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 92.71428571428571) internal successors, (1298), 14 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:30,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:30,383 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:30,383 INFO L186 Difference]: Start difference. First operand has 157 places, 110 transitions, 513 flow. Second operand 14 states and 1298 transitions. [2021-12-14 16:38:30,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 139 transitions, 1153 flow [2021-12-14 16:38:30,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 139 transitions, 795 flow, removed 168 selfloop flow, removed 17 redundant places. [2021-12-14 16:38:30,419 INFO L242 Difference]: Finished difference. Result has 154 places, 112 transitions, 506 flow [2021-12-14 16:38:30,419 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=506, PETRI_PLACES=154, PETRI_TRANSITIONS=112} [2021-12-14 16:38:30,419 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 37 predicate places. [2021-12-14 16:38:30,419 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 112 transitions, 506 flow [2021-12-14 16:38:30,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:30,420 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:30,420 INFO L254 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] [2021-12-14 16:38:30,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 16:38:30,420 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:38:30,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:30,421 INFO L85 PathProgramCache]: Analyzing trace with hash -273244172, now seen corresponding path program 1 times [2021-12-14 16:38:30,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:30,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377555076] [2021-12-14 16:38:30,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:30,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:38:30,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:30,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377555076] [2021-12-14 16:38:30,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377555076] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:30,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:30,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 16:38:30,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095986880] [2021-12-14 16:38:30,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:30,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 16:38:30,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:30,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 16:38:30,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-14 16:38:30,587 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 112 [2021-12-14 16:38:30,588 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 112 transitions, 506 flow. Second operand has 11 states, 11 states have (on average 88.72727272727273) internal successors, (976), 11 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:30,588 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:30,588 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 112 [2021-12-14 16:38:30,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:30,873 INFO L129 PetriNetUnfolder]: 186/807 cut-off events. [2021-12-14 16:38:30,873 INFO L130 PetriNetUnfolder]: For 5987/6173 co-relation queries the response was YES. [2021-12-14 16:38:30,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3485 conditions, 807 events. 186/807 cut-off events. For 5987/6173 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5648 event pairs, 74 based on Foata normal form. 22/760 useless extension candidates. Maximal degree in co-relation 3393. Up to 276 conditions per place. [2021-12-14 16:38:30,879 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 27 selfloop transitions, 12 changer transitions 10/126 dead transitions. [2021-12-14 16:38:30,879 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 126 transitions, 770 flow [2021-12-14 16:38:30,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 16:38:30,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-14 16:38:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1173 transitions. [2021-12-14 16:38:30,882 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8056318681318682 [2021-12-14 16:38:30,882 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1173 transitions. [2021-12-14 16:38:30,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1173 transitions. [2021-12-14 16:38:30,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:30,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1173 transitions. [2021-12-14 16:38:30,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 90.23076923076923) internal successors, (1173), 13 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:30,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:30,889 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:30,890 INFO L186 Difference]: Start difference. First operand has 154 places, 112 transitions, 506 flow. Second operand 13 states and 1173 transitions. [2021-12-14 16:38:30,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 126 transitions, 770 flow [2021-12-14 16:38:30,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 126 transitions, 674 flow, removed 42 selfloop flow, removed 11 redundant places. [2021-12-14 16:38:30,900 INFO L242 Difference]: Finished difference. Result has 156 places, 113 transitions, 521 flow [2021-12-14 16:38:30,900 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=521, PETRI_PLACES=156, PETRI_TRANSITIONS=113} [2021-12-14 16:38:30,901 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 39 predicate places. [2021-12-14 16:38:30,901 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 113 transitions, 521 flow [2021-12-14 16:38:30,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.72727272727273) internal successors, (976), 11 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:30,902 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:30,902 INFO L254 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] [2021-12-14 16:38:30,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 16:38:30,902 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:38:30,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:30,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1280545520, now seen corresponding path program 2 times [2021-12-14 16:38:30,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:30,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658983021] [2021-12-14 16:38:30,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:30,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:31,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:38:31,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:31,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658983021] [2021-12-14 16:38:31,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658983021] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:31,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:31,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-14 16:38:31,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714313006] [2021-12-14 16:38:31,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:31,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 16:38:31,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:31,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 16:38:31,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-12-14 16:38:31,141 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 112 [2021-12-14 16:38:31,142 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 113 transitions, 521 flow. Second operand has 13 states, 13 states have (on average 88.46153846153847) internal successors, (1150), 13 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:31,142 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:31,142 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 112 [2021-12-14 16:38:31,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:31,442 INFO L129 PetriNetUnfolder]: 187/795 cut-off events. [2021-12-14 16:38:31,443 INFO L130 PetriNetUnfolder]: For 5731/5809 co-relation queries the response was YES. [2021-12-14 16:38:31,450 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3355 conditions, 795 events. 187/795 cut-off events. For 5731/5809 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5352 event pairs, 89 based on Foata normal form. 32/750 useless extension candidates. Maximal degree in co-relation 3262. Up to 274 conditions per place. [2021-12-14 16:38:31,453 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 25 selfloop transitions, 15 changer transitions 10/127 dead transitions. [2021-12-14 16:38:31,453 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 127 transitions, 787 flow [2021-12-14 16:38:31,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 16:38:31,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-14 16:38:31,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1259 transitions. [2021-12-14 16:38:31,455 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8029336734693877 [2021-12-14 16:38:31,456 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1259 transitions. [2021-12-14 16:38:31,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1259 transitions. [2021-12-14 16:38:31,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:31,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1259 transitions. [2021-12-14 16:38:31,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 89.92857142857143) internal successors, (1259), 14 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:31,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:31,460 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:31,460 INFO L186 Difference]: Start difference. First operand has 156 places, 113 transitions, 521 flow. Second operand 14 states and 1259 transitions. [2021-12-14 16:38:31,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 127 transitions, 787 flow [2021-12-14 16:38:31,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 127 transitions, 700 flow, removed 33 selfloop flow, removed 11 redundant places. [2021-12-14 16:38:31,469 INFO L242 Difference]: Finished difference. Result has 159 places, 114 transitions, 546 flow [2021-12-14 16:38:31,469 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=546, PETRI_PLACES=159, PETRI_TRANSITIONS=114} [2021-12-14 16:38:31,469 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 42 predicate places. [2021-12-14 16:38:31,469 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 114 transitions, 546 flow [2021-12-14 16:38:31,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 88.46153846153847) internal successors, (1150), 13 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:31,470 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:31,471 INFO L254 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] [2021-12-14 16:38:31,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 16:38:31,471 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:38:31,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:31,471 INFO L85 PathProgramCache]: Analyzing trace with hash 702534384, now seen corresponding path program 3 times [2021-12-14 16:38:31,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:31,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117223034] [2021-12-14 16:38:31,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:31,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:31,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:38:31,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:31,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117223034] [2021-12-14 16:38:31,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117223034] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:31,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:31,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 16:38:31,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135916667] [2021-12-14 16:38:31,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:31,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 16:38:31,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:31,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 16:38:31,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-14 16:38:31,615 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2021-12-14 16:38:31,616 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 114 transitions, 546 flow. Second operand has 10 states, 10 states have (on average 89.8) internal successors, (898), 10 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:31,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:31,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2021-12-14 16:38:31,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:31,833 INFO L129 PetriNetUnfolder]: 146/748 cut-off events. [2021-12-14 16:38:31,833 INFO L130 PetriNetUnfolder]: For 4731/4915 co-relation queries the response was YES. [2021-12-14 16:38:31,836 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2933 conditions, 748 events. 146/748 cut-off events. For 4731/4915 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5332 event pairs, 50 based on Foata normal form. 23/700 useless extension candidates. Maximal degree in co-relation 2839. Up to 137 conditions per place. [2021-12-14 16:38:31,838 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 33 selfloop transitions, 10 changer transitions 10/131 dead transitions. [2021-12-14 16:38:31,838 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 131 transitions, 853 flow [2021-12-14 16:38:31,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 16:38:31,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-14 16:38:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1097 transitions. [2021-12-14 16:38:31,840 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8162202380952381 [2021-12-14 16:38:31,840 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1097 transitions. [2021-12-14 16:38:31,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1097 transitions. [2021-12-14 16:38:31,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:31,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1097 transitions. [2021-12-14 16:38:31,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 91.41666666666667) internal successors, (1097), 12 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:31,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:31,844 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:31,844 INFO L186 Difference]: Start difference. First operand has 159 places, 114 transitions, 546 flow. Second operand 12 states and 1097 transitions. [2021-12-14 16:38:31,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 131 transitions, 853 flow [2021-12-14 16:38:31,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 131 transitions, 743 flow, removed 43 selfloop flow, removed 12 redundant places. [2021-12-14 16:38:31,853 INFO L242 Difference]: Finished difference. Result has 159 places, 115 transitions, 543 flow [2021-12-14 16:38:31,853 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=543, PETRI_PLACES=159, PETRI_TRANSITIONS=115} [2021-12-14 16:38:31,853 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 42 predicate places. [2021-12-14 16:38:31,854 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 115 transitions, 543 flow [2021-12-14 16:38:31,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.8) internal successors, (898), 10 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:31,854 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:31,854 INFO L254 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] [2021-12-14 16:38:31,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 16:38:31,854 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:38:31,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:31,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1230477542, now seen corresponding path program 1 times [2021-12-14 16:38:31,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:31,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638910600] [2021-12-14 16:38:31,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:31,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:38:31,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:31,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638910600] [2021-12-14 16:38:31,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638910600] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:31,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:31,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 16:38:31,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072632896] [2021-12-14 16:38:31,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:31,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:38:31,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:31,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:38:31,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:38:31,915 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2021-12-14 16:38:31,916 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 115 transitions, 543 flow. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:31,916 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:31,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2021-12-14 16:38:31,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:32,644 INFO L129 PetriNetUnfolder]: 3030/5894 cut-off events. [2021-12-14 16:38:32,645 INFO L130 PetriNetUnfolder]: For 27867/28450 co-relation queries the response was YES. [2021-12-14 16:38:32,667 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19485 conditions, 5894 events. 3030/5894 cut-off events. For 27867/28450 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 48550 event pairs, 82 based on Foata normal form. 422/5939 useless extension candidates. Maximal degree in co-relation 19396. Up to 2028 conditions per place. [2021-12-14 16:38:32,675 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 45 selfloop transitions, 6 changer transitions 108/238 dead transitions. [2021-12-14 16:38:32,675 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 238 transitions, 2026 flow [2021-12-14 16:38:32,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 16:38:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-14 16:38:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 964 transitions. [2021-12-14 16:38:32,677 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8607142857142858 [2021-12-14 16:38:32,677 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 964 transitions. [2021-12-14 16:38:32,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 964 transitions. [2021-12-14 16:38:32,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:32,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 964 transitions. [2021-12-14 16:38:32,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.4) internal successors, (964), 10 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:32,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:32,680 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:32,680 INFO L186 Difference]: Start difference. First operand has 159 places, 115 transitions, 543 flow. Second operand 10 states and 964 transitions. [2021-12-14 16:38:32,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 238 transitions, 2026 flow [2021-12-14 16:38:32,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 238 transitions, 1943 flow, removed 27 selfloop flow, removed 12 redundant places. [2021-12-14 16:38:32,703 INFO L242 Difference]: Finished difference. Result has 156 places, 110 transitions, 503 flow [2021-12-14 16:38:32,703 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=503, PETRI_PLACES=156, PETRI_TRANSITIONS=110} [2021-12-14 16:38:32,703 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 39 predicate places. [2021-12-14 16:38:32,703 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 110 transitions, 503 flow [2021-12-14 16:38:32,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:32,704 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:32,704 INFO L254 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] [2021-12-14 16:38:32,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 16:38:32,704 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:38:32,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:32,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1206568631, now seen corresponding path program 1 times [2021-12-14 16:38:32,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:32,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675523065] [2021-12-14 16:38:32,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:32,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:38:32,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:32,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675523065] [2021-12-14 16:38:32,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675523065] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:32,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:32,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 16:38:32,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769668398] [2021-12-14 16:38:32,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:32,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 16:38:32,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:32,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 16:38:32,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:38:32,776 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2021-12-14 16:38:32,777 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 110 transitions, 503 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:32,777 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:32,777 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2021-12-14 16:38:32,777 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:33,152 INFO L129 PetriNetUnfolder]: 681/1871 cut-off events. [2021-12-14 16:38:33,152 INFO L130 PetriNetUnfolder]: For 8157/8342 co-relation queries the response was YES. [2021-12-14 16:38:33,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7329 conditions, 1871 events. 681/1871 cut-off events. For 8157/8342 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 14783 event pairs, 23 based on Foata normal form. 181/2007 useless extension candidates. Maximal degree in co-relation 7243. Up to 593 conditions per place. [2021-12-14 16:38:33,164 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 42 selfloop transitions, 9 changer transitions 71/201 dead transitions. [2021-12-14 16:38:33,164 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 201 transitions, 1666 flow [2021-12-14 16:38:33,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 16:38:33,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-14 16:38:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 962 transitions. [2021-12-14 16:38:33,165 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8589285714285714 [2021-12-14 16:38:33,165 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 962 transitions. [2021-12-14 16:38:33,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 962 transitions. [2021-12-14 16:38:33,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:33,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 962 transitions. [2021-12-14 16:38:33,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.2) internal successors, (962), 10 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:33,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:33,176 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:33,177 INFO L186 Difference]: Start difference. First operand has 156 places, 110 transitions, 503 flow. Second operand 10 states and 962 transitions. [2021-12-14 16:38:33,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 201 transitions, 1666 flow [2021-12-14 16:38:33,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 201 transitions, 1522 flow, removed 11 selfloop flow, removed 15 redundant places. [2021-12-14 16:38:33,191 INFO L242 Difference]: Finished difference. Result has 150 places, 113 transitions, 529 flow [2021-12-14 16:38:33,191 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=529, PETRI_PLACES=150, PETRI_TRANSITIONS=113} [2021-12-14 16:38:33,191 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 33 predicate places. [2021-12-14 16:38:33,192 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 113 transitions, 529 flow [2021-12-14 16:38:33,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:33,193 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:33,193 INFO L254 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] [2021-12-14 16:38:33,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 16:38:33,193 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:38:33,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:33,194 INFO L85 PathProgramCache]: Analyzing trace with hash 894880082, now seen corresponding path program 1 times [2021-12-14 16:38:33,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:33,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400355166] [2021-12-14 16:38:33,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:33,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:38:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:38:33,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:38:33,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400355166] [2021-12-14 16:38:33,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400355166] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:38:33,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:38:33,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 16:38:33,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120031952] [2021-12-14 16:38:33,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:38:33,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 16:38:33,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:38:33,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 16:38:33,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 16:38:33,286 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2021-12-14 16:38:33,287 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 113 transitions, 529 flow. Second operand has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:33,287 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:38:33,287 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2021-12-14 16:38:33,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:38:33,506 INFO L129 PetriNetUnfolder]: 188/789 cut-off events. [2021-12-14 16:38:33,507 INFO L130 PetriNetUnfolder]: For 3574/3677 co-relation queries the response was YES. [2021-12-14 16:38:33,511 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3039 conditions, 789 events. 188/789 cut-off events. For 3574/3677 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5477 event pairs, 2 based on Foata normal form. 69/838 useless extension candidates. Maximal degree in co-relation 2957. Up to 213 conditions per place. [2021-12-14 16:38:33,513 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 20 selfloop transitions, 12 changer transitions 54/160 dead transitions. [2021-12-14 16:38:33,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 160 transitions, 1158 flow [2021-12-14 16:38:33,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 16:38:33,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-14 16:38:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1033 transitions. [2021-12-14 16:38:33,515 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.838474025974026 [2021-12-14 16:38:33,515 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1033 transitions. [2021-12-14 16:38:33,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1033 transitions. [2021-12-14 16:38:33,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:38:33,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1033 transitions. [2021-12-14 16:38:33,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 93.9090909090909) internal successors, (1033), 11 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:33,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:33,522 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:33,522 INFO L186 Difference]: Start difference. First operand has 150 places, 113 transitions, 529 flow. Second operand 11 states and 1033 transitions. [2021-12-14 16:38:33,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 160 transitions, 1158 flow [2021-12-14 16:38:33,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 160 transitions, 942 flow, removed 89 selfloop flow, removed 15 redundant places. [2021-12-14 16:38:33,532 INFO L242 Difference]: Finished difference. Result has 147 places, 100 transitions, 376 flow [2021-12-14 16:38:33,532 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=376, PETRI_PLACES=147, PETRI_TRANSITIONS=100} [2021-12-14 16:38:33,533 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 30 predicate places. [2021-12-14 16:38:33,533 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 100 transitions, 376 flow [2021-12-14 16:38:33,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 16:38:33,533 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:38:33,533 INFO L254 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] [2021-12-14 16:38:33,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 16:38:33,534 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-14 16:38:33,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:38:33,534 INFO L85 PathProgramCache]: Analyzing trace with hash -37476948, now seen corresponding path program 1 times [2021-12-14 16:38:33,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:38:33,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155384996] [2021-12-14 16:38:33,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:38:33,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:38:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 16:38:33,566 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 16:38:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 16:38:33,638 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 16:38:33,638 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 16:38:33,639 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-12-14 16:38:33,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-12-14 16:38:33,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-12-14 16:38:33,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-12-14 16:38:33,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-12-14 16:38:33,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-12-14 16:38:33,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 16:38:33,645 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 16:38:33,649 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-14 16:38:33,650 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 16:38:33,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 04:38:33 BasicIcfg [2021-12-14 16:38:33,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 16:38:33,745 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 16:38:33,745 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 16:38:33,746 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 16:38:33,746 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:38:24" (3/4) ... [2021-12-14 16:38:33,747 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 16:38:33,810 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 16:38:33,811 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 16:38:33,811 INFO L158 Benchmark]: Toolchain (without parser) took 10313.72ms. Allocated memory was 109.1MB in the beginning and 478.2MB in the end (delta: 369.1MB). Free memory was 76.7MB in the beginning and 234.2MB in the end (delta: -157.4MB). Peak memory consumption was 211.6MB. Max. memory is 16.1GB. [2021-12-14 16:38:33,811 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 41.2MB in the beginning and 41.1MB in the end (delta: 32.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 16:38:33,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.84ms. Allocated memory is still 109.1MB. Free memory was 76.7MB in the beginning and 73.6MB in the end (delta: 3.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-14 16:38:33,812 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.70ms. Allocated memory is still 109.1MB. Free memory was 73.6MB in the beginning and 71.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 16:38:33,812 INFO L158 Benchmark]: Boogie Preprocessor took 42.49ms. Allocated memory is still 109.1MB. Free memory was 71.0MB in the beginning and 68.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 16:38:33,812 INFO L158 Benchmark]: RCFGBuilder took 780.54ms. Allocated memory is still 109.1MB. Free memory was 68.4MB in the beginning and 48.1MB in the end (delta: 20.2MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2021-12-14 16:38:33,813 INFO L158 Benchmark]: TraceAbstraction took 9000.53ms. Allocated memory was 109.1MB in the beginning and 478.2MB in the end (delta: 369.1MB). Free memory was 48.1MB in the beginning and 260.4MB in the end (delta: -212.2MB). Peak memory consumption was 157.1MB. Max. memory is 16.1GB. [2021-12-14 16:38:33,813 INFO L158 Benchmark]: Witness Printer took 65.51ms. Allocated memory is still 478.2MB. Free memory was 260.4MB in the beginning and 234.2MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-12-14 16:38:33,814 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.18ms. Allocated memory is still 83.9MB. Free memory was 41.2MB in the beginning and 41.1MB in the end (delta: 32.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.84ms. Allocated memory is still 109.1MB. Free memory was 76.7MB in the beginning and 73.6MB in the end (delta: 3.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.70ms. Allocated memory is still 109.1MB. Free memory was 73.6MB in the beginning and 71.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.49ms. Allocated memory is still 109.1MB. Free memory was 71.0MB in the beginning and 68.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 780.54ms. Allocated memory is still 109.1MB. Free memory was 68.4MB in the beginning and 48.1MB in the end (delta: 20.2MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9000.53ms. Allocated memory was 109.1MB in the beginning and 478.2MB in the end (delta: 369.1MB). Free memory was 48.1MB in the beginning and 260.4MB in the end (delta: -212.2MB). Peak memory consumption was 157.1MB. Max. memory is 16.1GB. * Witness Printer took 65.51ms. Allocated memory is still 478.2MB. Free memory was 260.4MB in the beginning and 234.2MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L716] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L717] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L718] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L719] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L720] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L721] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=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] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L725] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=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] [L726] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L727] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L728] 0 int y$w_buff0; VAL [__unbuffered_cnt=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] [L729] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L730] 0 int y$w_buff1; VAL [__unbuffered_cnt=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] [L731] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L733] 0 int z = 0; VAL [__unbuffered_cnt=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, z=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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, z=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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, z=0] [L811] 0 pthread_t t2492; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492={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, z=0] [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-2, t2492={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, z=0] [L813] 0 pthread_t t2493; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={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, z=0] [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-1, t2492={5:0}, t2493={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, z=0] [L815] 0 pthread_t t2494; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={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, z=0] [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=0, t2492={5:0}, t2493={6:0}, t2494={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, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] 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) [L789] 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) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 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 [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 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 [L760] 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) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] 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) [L760] 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) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 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 [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 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 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 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) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] 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) [L822] 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) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 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 [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 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 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 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) [L833] 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) [L834] 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)) [L834] 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)) [L835] 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)) [L835] 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)) [L836] 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)) [L836] 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)) [L837] 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)) [L837] 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)) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, 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=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, 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=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 812]: 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 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: 8.8s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 726 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 726 mSDsluCounter, 724 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1114 mSDsCounter, 245 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1891 IncrementalHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 245 mSolverCounterUnsat, 145 mSDtfsCounter, 1891 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=546occurred in iteration=13, InterpolantAutomatonStates: 192, 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, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1394 NumberOfCodeBlocks, 1394 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1291 ConstructedInterpolants, 0 QuantifiedInterpolants, 7088 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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! [2021-12-14 16:38:33,843 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