./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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/mix030_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 9565dcbef2b519c6326563c41ab6633c2e0b59b7d9ee2c8626de0cd3767b77b1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 02:48:02,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 02:48:02,503 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 02:48:02,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 02:48:02,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 02:48:02,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 02:48:02,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 02:48:02,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 02:48:02,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 02:48:02,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 02:48:02,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 02:48:02,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 02:48:02,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 02:48:02,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 02:48:02,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 02:48:02,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 02:48:02,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 02:48:02,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 02:48:02,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 02:48:02,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 02:48:02,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 02:48:02,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 02:48:02,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 02:48:02,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 02:48:02,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 02:48:02,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 02:48:02,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 02:48:02,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 02:48:02,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 02:48:02,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 02:48:02,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 02:48:02,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 02:48:02,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 02:48:02,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 02:48:02,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 02:48:02,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 02:48:02,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 02:48:02,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 02:48:02,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 02:48:02,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 02:48:02,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 02:48:02,612 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-28 02:48:02,649 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 02:48:02,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 02:48:02,650 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 02:48:02,650 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 02:48:02,651 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 02:48:02,651 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 02:48:02,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 02:48:02,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 02:48:02,653 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 02:48:02,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 02:48:02,654 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 02:48:02,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 02:48:02,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 02:48:02,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 02:48:02,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 02:48:02,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 02:48:02,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 02:48:02,655 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 02:48:02,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 02:48:02,656 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 02:48:02,656 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 02:48:02,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 02:48:02,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 02:48:02,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 02:48:02,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 02:48:02,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 02:48:02,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 02:48:02,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 02:48:02,658 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 02:48:02,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 02:48:02,658 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 02:48:02,658 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 02:48:02,659 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 02:48:02,659 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 -> 9565dcbef2b519c6326563c41ab6633c2e0b59b7d9ee2c8626de0cd3767b77b1 [2021-12-28 02:48:02,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 02:48:02,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 02:48:02,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 02:48:02,963 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 02:48:02,964 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 02:48:02,965 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2021-12-28 02:48:03,021 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ff733f7/3083a4974873466682a5ea05b66160aa/FLAGc18c1aa67 [2021-12-28 02:48:03,587 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 02:48:03,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2021-12-28 02:48:03,603 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ff733f7/3083a4974873466682a5ea05b66160aa/FLAGc18c1aa67 [2021-12-28 02:48:04,003 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ff733f7/3083a4974873466682a5ea05b66160aa [2021-12-28 02:48:04,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 02:48:04,007 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 02:48:04,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 02:48:04,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 02:48:04,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 02:48:04,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:48:04" (1/1) ... [2021-12-28 02:48:04,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@316c0fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:04, skipping insertion in model container [2021-12-28 02:48:04,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:48:04" (1/1) ... [2021-12-28 02:48:04,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 02:48:04,086 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 02:48:04,261 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/mix030_power.opt_pso.opt_rmo.opt.i[966,979] [2021-12-28 02:48:04,472 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 02:48:04,478 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 02:48:04,488 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/mix030_power.opt_pso.opt_rmo.opt.i[966,979] [2021-12-28 02:48:04,549 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 02:48:04,604 INFO L208 MainTranslator]: Completed translation [2021-12-28 02:48:04,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:04 WrapperNode [2021-12-28 02:48:04,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 02:48:04,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 02:48:04,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 02:48:04,606 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 02:48:04,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:04" (1/1) ... [2021-12-28 02:48:04,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:04" (1/1) ... [2021-12-28 02:48:04,691 INFO L137 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 290 [2021-12-28 02:48:04,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 02:48:04,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 02:48:04,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 02:48:04,693 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 02:48:04,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:04" (1/1) ... [2021-12-28 02:48:04,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:04" (1/1) ... [2021-12-28 02:48:04,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:04" (1/1) ... [2021-12-28 02:48:04,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:04" (1/1) ... [2021-12-28 02:48:04,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:04" (1/1) ... [2021-12-28 02:48:04,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:04" (1/1) ... [2021-12-28 02:48:04,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:04" (1/1) ... [2021-12-28 02:48:04,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 02:48:04,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 02:48:04,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 02:48:04,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 02:48:04,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:04" (1/1) ... [2021-12-28 02:48:04,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 02:48:04,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 02:48:04,789 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-28 02:48:04,802 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-28 02:48:04,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 02:48:04,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-28 02:48:04,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 02:48:04,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 02:48:04,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 02:48:04,829 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-28 02:48:04,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-28 02:48:04,829 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-28 02:48:04,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-28 02:48:04,829 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-28 02:48:04,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-28 02:48:04,830 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-12-28 02:48:04,830 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-12-28 02:48:04,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 02:48:04,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-28 02:48:04,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 02:48:04,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 02:48:04,832 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-28 02:48:04,950 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 02:48:04,952 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 02:48:05,469 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 02:48:05,769 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 02:48:05,769 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-28 02:48:05,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:48:05 BoogieIcfgContainer [2021-12-28 02:48:05,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 02:48:05,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 02:48:05,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 02:48:05,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 02:48:05,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 02:48:04" (1/3) ... [2021-12-28 02:48:05,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6539fc17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:48:05, skipping insertion in model container [2021-12-28 02:48:05,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:48:04" (2/3) ... [2021-12-28 02:48:05,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6539fc17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:48:05, skipping insertion in model container [2021-12-28 02:48:05,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:48:05" (3/3) ... [2021-12-28 02:48:05,779 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_power.opt_pso.opt_rmo.opt.i [2021-12-28 02:48:05,784 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-28 02:48:05,784 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 02:48:05,784 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-28 02:48:05,785 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-28 02:48:05,838 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,838 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,838 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,838 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,839 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,839 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,839 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,839 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,840 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,841 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,841 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,841 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,841 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,842 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,842 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,842 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,842 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,843 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,843 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,843 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,844 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,844 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,844 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,844 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,845 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,845 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,845 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,846 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,846 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,846 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,846 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,846 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,847 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,847 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,847 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,848 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,848 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,848 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,849 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,849 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,849 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,849 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,849 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,850 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,850 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,850 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,850 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,850 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,851 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,851 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,851 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,851 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,852 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,852 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,852 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,852 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,852 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,853 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,853 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,853 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,854 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,855 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,855 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,855 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,855 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,855 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,856 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,857 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,857 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,858 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,858 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,858 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,858 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,859 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,859 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,861 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,862 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,862 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,863 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,863 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,863 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,864 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,864 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,864 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,869 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,869 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,869 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,869 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,869 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,870 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,871 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,871 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,871 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,871 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,874 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,874 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,874 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,874 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,875 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,875 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,875 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,876 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,876 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,876 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,876 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,877 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,877 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,877 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,877 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,878 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,878 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,878 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,878 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,878 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,879 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,879 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,879 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,879 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:48:05,883 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-28 02:48:05,942 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 02:48:05,951 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-28 02:48:05,951 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-28 02:48:05,963 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 290 flow [2021-12-28 02:48:06,025 INFO L129 PetriNetUnfolder]: 2/131 cut-off events. [2021-12-28 02:48:06,026 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-28 02:48:06,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2021-12-28 02:48:06,030 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 135 transitions, 290 flow [2021-12-28 02:48:06,038 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 131 transitions, 274 flow [2021-12-28 02:48:06,056 INFO L129 PetriNetUnfolder]: 0/77 cut-off events. [2021-12-28 02:48:06,056 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-28 02:48:06,057 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:48:06,058 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] [2021-12-28 02:48:06,058 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:48:06,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:48:06,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1442612500, now seen corresponding path program 1 times [2021-12-28 02:48:06,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:48:06,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939658810] [2021-12-28 02:48:06,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:48:06,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:48:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:48:06,416 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-28 02:48:06,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:48:06,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939658810] [2021-12-28 02:48:06,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939658810] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:48:06,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:48:06,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 02:48:06,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809096822] [2021-12-28 02:48:06,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:48:06,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 02:48:06,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:48:06,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 02:48:06,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 02:48:06,463 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 135 [2021-12-28 02:48:06,469 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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-28 02:48:06,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:48:06,469 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 135 [2021-12-28 02:48:06,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:48:06,642 INFO L129 PetriNetUnfolder]: 57/361 cut-off events. [2021-12-28 02:48:06,642 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-12-28 02:48:06,647 INFO L84 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 361 events. 57/361 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1448 event pairs, 17 based on Foata normal form. 16/358 useless extension candidates. Maximal degree in co-relation 434. Up to 75 conditions per place. [2021-12-28 02:48:06,650 INFO L132 encePairwiseOnDemand]: 130/135 looper letters, 14 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2021-12-28 02:48:06,650 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 132 transitions, 311 flow [2021-12-28 02:48:06,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 02:48:06,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-28 02:48:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2021-12-28 02:48:06,669 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9407407407407408 [2021-12-28 02:48:06,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2021-12-28 02:48:06,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2021-12-28 02:48:06,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:48:06,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2021-12-28 02:48:06,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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-28 02:48:06,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 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-28 02:48:06,688 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 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-28 02:48:06,689 INFO L186 Difference]: Start difference. First operand has 142 places, 131 transitions, 274 flow. Second operand 3 states and 381 transitions. [2021-12-28 02:48:06,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 132 transitions, 311 flow [2021-12-28 02:48:06,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 132 transitions, 306 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-28 02:48:06,697 INFO L242 Difference]: Finished difference. Result has 138 places, 127 transitions, 266 flow [2021-12-28 02:48:06,699 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=138, PETRI_TRANSITIONS=127} [2021-12-28 02:48:06,702 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, -4 predicate places. [2021-12-28 02:48:06,703 INFO L470 AbstractCegarLoop]: Abstraction has has 138 places, 127 transitions, 266 flow [2021-12-28 02:48:06,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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-28 02:48:06,703 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:48:06,703 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] [2021-12-28 02:48:06,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 02:48:06,704 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:48:06,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:48:06,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1620607474, now seen corresponding path program 1 times [2021-12-28 02:48:06,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:48:06,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509432225] [2021-12-28 02:48:06,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:48:06,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:48:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:48:06,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-28 02:48:06,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:48:06,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509432225] [2021-12-28 02:48:06,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509432225] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:48:06,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:48:06,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:48:06,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345302694] [2021-12-28 02:48:06,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:48:06,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:48:06,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:48:06,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:48:06,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:48:06,989 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 135 [2021-12-28 02:48:06,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 127 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-28 02:48:06,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:48:06,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 135 [2021-12-28 02:48:06,991 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:48:07,609 INFO L129 PetriNetUnfolder]: 724/2188 cut-off events. [2021-12-28 02:48:07,609 INFO L130 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2021-12-28 02:48:07,617 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3439 conditions, 2188 events. 724/2188 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 17048 event pairs, 222 based on Foata normal form. 0/2123 useless extension candidates. Maximal degree in co-relation 3384. Up to 652 conditions per place. [2021-12-28 02:48:07,623 INFO L132 encePairwiseOnDemand]: 128/135 looper letters, 22 selfloop transitions, 3 changer transitions 56/175 dead transitions. [2021-12-28 02:48:07,624 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 175 transitions, 514 flow [2021-12-28 02:48:07,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 02:48:07,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 02:48:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1069 transitions. [2021-12-28 02:48:07,630 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8798353909465021 [2021-12-28 02:48:07,630 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1069 transitions. [2021-12-28 02:48:07,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1069 transitions. [2021-12-28 02:48:07,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:48:07,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1069 transitions. [2021-12-28 02:48:07,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 0 states have call successors, (0), 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-28 02:48:07,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 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-28 02:48:07,638 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 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-28 02:48:07,638 INFO L186 Difference]: Start difference. First operand has 138 places, 127 transitions, 266 flow. Second operand 9 states and 1069 transitions. [2021-12-28 02:48:07,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 175 transitions, 514 flow [2021-12-28 02:48:07,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 175 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-28 02:48:07,645 INFO L242 Difference]: Finished difference. Result has 151 places, 115 transitions, 277 flow [2021-12-28 02:48:07,645 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=277, PETRI_PLACES=151, PETRI_TRANSITIONS=115} [2021-12-28 02:48:07,646 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 9 predicate places. [2021-12-28 02:48:07,646 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 115 transitions, 277 flow [2021-12-28 02:48:07,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-28 02:48:07,647 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:48:07,647 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-28 02:48:07,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 02:48:07,647 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:48:07,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:48:07,649 INFO L85 PathProgramCache]: Analyzing trace with hash -256106927, now seen corresponding path program 1 times [2021-12-28 02:48:07,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:48:07,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742220164] [2021-12-28 02:48:07,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:48:07,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:48:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:48:07,936 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-28 02:48:07,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:48:07,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742220164] [2021-12-28 02:48:07,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742220164] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:48:07,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:48:07,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 02:48:07,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705215275] [2021-12-28 02:48:07,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:48:07,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 02:48:07,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:48:07,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 02:48:07,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-28 02:48:07,942 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 135 [2021-12-28 02:48:07,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 115 transitions, 277 flow. Second operand has 10 states, 10 states have (on average 111.5) internal successors, (1115), 10 states have internal predecessors, (1115), 0 states have call successors, (0), 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-28 02:48:07,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:48:07,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 135 [2021-12-28 02:48:07,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:48:08,513 INFO L129 PetriNetUnfolder]: 496/1182 cut-off events. [2021-12-28 02:48:08,513 INFO L130 PetriNetUnfolder]: For 798/801 co-relation queries the response was YES. [2021-12-28 02:48:08,520 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2592 conditions, 1182 events. 496/1182 cut-off events. For 798/801 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7139 event pairs, 231 based on Foata normal form. 24/1153 useless extension candidates. Maximal degree in co-relation 2527. Up to 487 conditions per place. [2021-12-28 02:48:08,527 INFO L132 encePairwiseOnDemand]: 122/135 looper letters, 20 selfloop transitions, 12 changer transitions 43/170 dead transitions. [2021-12-28 02:48:08,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 170 transitions, 571 flow [2021-12-28 02:48:08,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 02:48:08,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-28 02:48:08,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1728 transitions. [2021-12-28 02:48:08,532 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8533333333333334 [2021-12-28 02:48:08,532 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1728 transitions. [2021-12-28 02:48:08,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1728 transitions. [2021-12-28 02:48:08,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:48:08,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1728 transitions. [2021-12-28 02:48:08,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 115.2) internal successors, (1728), 15 states have internal predecessors, (1728), 0 states have call successors, (0), 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-28 02:48:08,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 135.0) internal successors, (2160), 16 states have internal predecessors, (2160), 0 states have call successors, (0), 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-28 02:48:08,542 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 135.0) internal successors, (2160), 16 states have internal predecessors, (2160), 0 states have call successors, (0), 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-28 02:48:08,542 INFO L186 Difference]: Start difference. First operand has 151 places, 115 transitions, 277 flow. Second operand 15 states and 1728 transitions. [2021-12-28 02:48:08,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 170 transitions, 571 flow [2021-12-28 02:48:08,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 170 transitions, 550 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-12-28 02:48:08,555 INFO L242 Difference]: Finished difference. Result has 152 places, 123 transitions, 366 flow [2021-12-28 02:48:08,556 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=366, PETRI_PLACES=152, PETRI_TRANSITIONS=123} [2021-12-28 02:48:08,558 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 10 predicate places. [2021-12-28 02:48:08,558 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 123 transitions, 366 flow [2021-12-28 02:48:08,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 111.5) internal successors, (1115), 10 states have internal predecessors, (1115), 0 states have call successors, (0), 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-28 02:48:08,559 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:48:08,559 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, 1] [2021-12-28 02:48:08,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 02:48:08,560 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:48:08,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:48:08,563 INFO L85 PathProgramCache]: Analyzing trace with hash 628173759, now seen corresponding path program 1 times [2021-12-28 02:48:08,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:48:08,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393719978] [2021-12-28 02:48:08,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:48:08,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:48:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:48:08,745 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-28 02:48:08,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:48:08,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393719978] [2021-12-28 02:48:08,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393719978] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:48:08,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:48:08,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:48:08,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382799639] [2021-12-28 02:48:08,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:48:08,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:48:08,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:48:08,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:48:08,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:48:08,753 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 135 [2021-12-28 02:48:08,754 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 123 transitions, 366 flow. Second operand has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:48:08,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:48:08,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 135 [2021-12-28 02:48:08,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:48:09,370 INFO L129 PetriNetUnfolder]: 872/1978 cut-off events. [2021-12-28 02:48:09,370 INFO L130 PetriNetUnfolder]: For 5202/5670 co-relation queries the response was YES. [2021-12-28 02:48:09,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6431 conditions, 1978 events. 872/1978 cut-off events. For 5202/5670 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13399 event pairs, 283 based on Foata normal form. 42/1971 useless extension candidates. Maximal degree in co-relation 6356. Up to 627 conditions per place. [2021-12-28 02:48:09,397 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 54 selfloop transitions, 12 changer transitions 9/171 dead transitions. [2021-12-28 02:48:09,398 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 171 transitions, 786 flow [2021-12-28 02:48:09,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 02:48:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 02:48:09,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1065 transitions. [2021-12-28 02:48:09,402 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8765432098765432 [2021-12-28 02:48:09,402 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1065 transitions. [2021-12-28 02:48:09,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1065 transitions. [2021-12-28 02:48:09,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:48:09,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1065 transitions. [2021-12-28 02:48:09,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.33333333333333) internal successors, (1065), 9 states have internal predecessors, (1065), 0 states have call successors, (0), 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-28 02:48:09,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 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-28 02:48:09,409 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 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-28 02:48:09,409 INFO L186 Difference]: Start difference. First operand has 152 places, 123 transitions, 366 flow. Second operand 9 states and 1065 transitions. [2021-12-28 02:48:09,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 171 transitions, 786 flow [2021-12-28 02:48:09,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 171 transitions, 754 flow, removed 14 selfloop flow, removed 5 redundant places. [2021-12-28 02:48:09,425 INFO L242 Difference]: Finished difference. Result has 153 places, 132 transitions, 486 flow [2021-12-28 02:48:09,426 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=486, PETRI_PLACES=153, PETRI_TRANSITIONS=132} [2021-12-28 02:48:09,427 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 11 predicate places. [2021-12-28 02:48:09,427 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 132 transitions, 486 flow [2021-12-28 02:48:09,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:48:09,428 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:48:09,428 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, 1, 1] [2021-12-28 02:48:09,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 02:48:09,429 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:48:09,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:48:09,430 INFO L85 PathProgramCache]: Analyzing trace with hash -838440047, now seen corresponding path program 1 times [2021-12-28 02:48:09,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:48:09,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320537323] [2021-12-28 02:48:09,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:48:09,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:48:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:48:09,557 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-28 02:48:09,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:48:09,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320537323] [2021-12-28 02:48:09,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320537323] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:48:09,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:48:09,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:48:09,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661023196] [2021-12-28 02:48:09,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:48:09,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:48:09,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:48:09,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:48:09,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:48:09,561 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 135 [2021-12-28 02:48:09,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 132 transitions, 486 flow. Second operand has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 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-28 02:48:09,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:48:09,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 135 [2021-12-28 02:48:09,563 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:48:10,178 INFO L129 PetriNetUnfolder]: 916/2183 cut-off events. [2021-12-28 02:48:10,178 INFO L130 PetriNetUnfolder]: For 8970/9210 co-relation queries the response was YES. [2021-12-28 02:48:10,196 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7670 conditions, 2183 events. 916/2183 cut-off events. For 8970/9210 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 16133 event pairs, 182 based on Foata normal form. 51/2161 useless extension candidates. Maximal degree in co-relation 7592. Up to 632 conditions per place. [2021-12-28 02:48:10,206 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 40 selfloop transitions, 21 changer transitions 15/179 dead transitions. [2021-12-28 02:48:10,206 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 179 transitions, 996 flow [2021-12-28 02:48:10,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 02:48:10,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 02:48:10,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1071 transitions. [2021-12-28 02:48:10,210 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8814814814814815 [2021-12-28 02:48:10,210 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1071 transitions. [2021-12-28 02:48:10,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1071 transitions. [2021-12-28 02:48:10,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:48:10,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1071 transitions. [2021-12-28 02:48:10,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 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-28 02:48:10,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 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-28 02:48:10,215 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 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-28 02:48:10,215 INFO L186 Difference]: Start difference. First operand has 153 places, 132 transitions, 486 flow. Second operand 9 states and 1071 transitions. [2021-12-28 02:48:10,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 179 transitions, 996 flow [2021-12-28 02:48:10,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 179 transitions, 921 flow, removed 36 selfloop flow, removed 1 redundant places. [2021-12-28 02:48:10,244 INFO L242 Difference]: Finished difference. Result has 163 places, 149 transitions, 655 flow [2021-12-28 02:48:10,244 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=655, PETRI_PLACES=163, PETRI_TRANSITIONS=149} [2021-12-28 02:48:10,246 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 21 predicate places. [2021-12-28 02:48:10,247 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 149 transitions, 655 flow [2021-12-28 02:48:10,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 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-28 02:48:10,247 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:48:10,248 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, 1, 1, 1] [2021-12-28 02:48:10,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 02:48:10,248 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:48:10,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:48:10,249 INFO L85 PathProgramCache]: Analyzing trace with hash -64510759, now seen corresponding path program 1 times [2021-12-28 02:48:10,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:48:10,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228079322] [2021-12-28 02:48:10,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:48:10,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:48:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:48:10,378 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-28 02:48:10,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:48:10,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228079322] [2021-12-28 02:48:10,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228079322] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:48:10,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:48:10,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:48:10,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248223825] [2021-12-28 02:48:10,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:48:10,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:48:10,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:48:10,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:48:10,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:48:10,382 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 135 [2021-12-28 02:48:10,382 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 149 transitions, 655 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 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-28 02:48:10,382 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:48:10,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 135 [2021-12-28 02:48:10,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:48:12,180 INFO L129 PetriNetUnfolder]: 4721/9120 cut-off events. [2021-12-28 02:48:12,180 INFO L130 PetriNetUnfolder]: For 37246/37941 co-relation queries the response was YES. [2021-12-28 02:48:12,241 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31471 conditions, 9120 events. 4721/9120 cut-off events. For 37246/37941 co-relation queries the response was YES. Maximal size of possible extension queue 912. Compared 82259 event pairs, 1632 based on Foata normal form. 96/8835 useless extension candidates. Maximal degree in co-relation 31389. Up to 3711 conditions per place. [2021-12-28 02:48:12,275 INFO L132 encePairwiseOnDemand]: 128/135 looper letters, 55 selfloop transitions, 3 changer transitions 75/238 dead transitions. [2021-12-28 02:48:12,275 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 238 transitions, 1641 flow [2021-12-28 02:48:12,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 02:48:12,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 02:48:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1077 transitions. [2021-12-28 02:48:12,278 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8864197530864197 [2021-12-28 02:48:12,279 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1077 transitions. [2021-12-28 02:48:12,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1077 transitions. [2021-12-28 02:48:12,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:48:12,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1077 transitions. [2021-12-28 02:48:12,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.66666666666667) internal successors, (1077), 9 states have internal predecessors, (1077), 0 states have call successors, (0), 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-28 02:48:12,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 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-28 02:48:12,285 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 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-28 02:48:12,285 INFO L186 Difference]: Start difference. First operand has 163 places, 149 transitions, 655 flow. Second operand 9 states and 1077 transitions. [2021-12-28 02:48:12,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 238 transitions, 1641 flow [2021-12-28 02:48:12,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 238 transitions, 1625 flow, removed 8 selfloop flow, removed 0 redundant places. [2021-12-28 02:48:12,528 INFO L242 Difference]: Finished difference. Result has 178 places, 151 transitions, 760 flow [2021-12-28 02:48:12,528 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=760, PETRI_PLACES=178, PETRI_TRANSITIONS=151} [2021-12-28 02:48:12,529 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 36 predicate places. [2021-12-28 02:48:12,529 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 151 transitions, 760 flow [2021-12-28 02:48:12,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 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-28 02:48:12,530 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:48:12,530 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, 1, 1, 1, 1] [2021-12-28 02:48:12,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 02:48:12,530 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:48:12,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:48:12,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1605402989, now seen corresponding path program 1 times [2021-12-28 02:48:12,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:48:12,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555377966] [2021-12-28 02:48:12,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:48:12,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:48:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:48:12,724 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-28 02:48:12,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:48:12,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555377966] [2021-12-28 02:48:12,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555377966] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:48:12,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:48:12,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-28 02:48:12,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179205836] [2021-12-28 02:48:12,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:48:12,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 02:48:12,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:48:12,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 02:48:12,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-28 02:48:12,729 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2021-12-28 02:48:12,730 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 151 transitions, 760 flow. Second operand has 11 states, 11 states have (on average 110.54545454545455) internal successors, (1216), 11 states have internal predecessors, (1216), 0 states have call successors, (0), 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-28 02:48:12,730 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:48:12,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2021-12-28 02:48:12,731 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:48:14,090 INFO L129 PetriNetUnfolder]: 2881/5699 cut-off events. [2021-12-28 02:48:14,091 INFO L130 PetriNetUnfolder]: For 41756/42083 co-relation queries the response was YES. [2021-12-28 02:48:14,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24400 conditions, 5699 events. 2881/5699 cut-off events. For 41756/42083 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 47690 event pairs, 862 based on Foata normal form. 41/5445 useless extension candidates. Maximal degree in co-relation 24305. Up to 2874 conditions per place. [2021-12-28 02:48:14,149 INFO L132 encePairwiseOnDemand]: 123/135 looper letters, 38 selfloop transitions, 11 changer transitions 81/226 dead transitions. [2021-12-28 02:48:14,149 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 226 transitions, 1762 flow [2021-12-28 02:48:14,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 02:48:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-28 02:48:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1825 transitions. [2021-12-28 02:48:14,156 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8449074074074074 [2021-12-28 02:48:14,157 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1825 transitions. [2021-12-28 02:48:14,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1825 transitions. [2021-12-28 02:48:14,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:48:14,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1825 transitions. [2021-12-28 02:48:14,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 114.0625) internal successors, (1825), 16 states have internal predecessors, (1825), 0 states have call successors, (0), 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-28 02:48:14,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 135.0) internal successors, (2295), 17 states have internal predecessors, (2295), 0 states have call successors, (0), 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-28 02:48:14,171 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 135.0) internal successors, (2295), 17 states have internal predecessors, (2295), 0 states have call successors, (0), 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-28 02:48:14,171 INFO L186 Difference]: Start difference. First operand has 178 places, 151 transitions, 760 flow. Second operand 16 states and 1825 transitions. [2021-12-28 02:48:14,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 226 transitions, 1762 flow [2021-12-28 02:48:14,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 226 transitions, 1669 flow, removed 45 selfloop flow, removed 4 redundant places. [2021-12-28 02:48:14,289 INFO L242 Difference]: Finished difference. Result has 194 places, 129 transitions, 512 flow [2021-12-28 02:48:14,290 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=512, PETRI_PLACES=194, PETRI_TRANSITIONS=129} [2021-12-28 02:48:14,290 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 52 predicate places. [2021-12-28 02:48:14,290 INFO L470 AbstractCegarLoop]: Abstraction has has 194 places, 129 transitions, 512 flow [2021-12-28 02:48:14,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 110.54545454545455) internal successors, (1216), 11 states have internal predecessors, (1216), 0 states have call successors, (0), 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-28 02:48:14,291 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:48:14,291 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, 1, 1, 1, 1, 1] [2021-12-28 02:48:14,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 02:48:14,291 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:48:14,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:48:14,292 INFO L85 PathProgramCache]: Analyzing trace with hash -780525375, now seen corresponding path program 1 times [2021-12-28 02:48:14,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:48:14,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123220397] [2021-12-28 02:48:14,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:48:14,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:48:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:48:14,541 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-28 02:48:14,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:48:14,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123220397] [2021-12-28 02:48:14,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123220397] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:48:14,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:48:14,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-28 02:48:14,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976408251] [2021-12-28 02:48:14,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:48:14,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 02:48:14,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:48:14,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 02:48:14,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-28 02:48:14,545 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2021-12-28 02:48:14,546 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 129 transitions, 512 flow. Second operand has 11 states, 11 states have (on average 110.63636363636364) internal successors, (1217), 11 states have internal predecessors, (1217), 0 states have call successors, (0), 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-28 02:48:14,546 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:48:14,547 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2021-12-28 02:48:14,547 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:48:15,388 INFO L129 PetriNetUnfolder]: 1440/3374 cut-off events. [2021-12-28 02:48:15,388 INFO L130 PetriNetUnfolder]: For 38507/38701 co-relation queries the response was YES. [2021-12-28 02:48:15,411 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17395 conditions, 3374 events. 1440/3374 cut-off events. For 38507/38701 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 27544 event pairs, 300 based on Foata normal form. 68/3270 useless extension candidates. Maximal degree in co-relation 17353. Up to 978 conditions per place. [2021-12-28 02:48:15,433 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 33 selfloop transitions, 11 changer transitions 31/171 dead transitions. [2021-12-28 02:48:15,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 171 transitions, 1155 flow [2021-12-28 02:48:15,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 02:48:15,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-28 02:48:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1482 transitions. [2021-12-28 02:48:15,438 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2021-12-28 02:48:15,438 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1482 transitions. [2021-12-28 02:48:15,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1482 transitions. [2021-12-28 02:48:15,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:48:15,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1482 transitions. [2021-12-28 02:48:15,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:48:15,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 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-28 02:48:15,447 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 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-28 02:48:15,447 INFO L186 Difference]: Start difference. First operand has 194 places, 129 transitions, 512 flow. Second operand 13 states and 1482 transitions. [2021-12-28 02:48:15,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 171 transitions, 1155 flow [2021-12-28 02:48:15,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 171 transitions, 1042 flow, removed 46 selfloop flow, removed 18 redundant places. [2021-12-28 02:48:15,485 INFO L242 Difference]: Finished difference. Result has 174 places, 131 transitions, 547 flow [2021-12-28 02:48:15,486 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=547, PETRI_PLACES=174, PETRI_TRANSITIONS=131} [2021-12-28 02:48:15,486 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 32 predicate places. [2021-12-28 02:48:15,486 INFO L470 AbstractCegarLoop]: Abstraction has has 174 places, 131 transitions, 547 flow [2021-12-28 02:48:15,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 110.63636363636364) internal successors, (1217), 11 states have internal predecessors, (1217), 0 states have call successors, (0), 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-28 02:48:15,487 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:48:15,487 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, 1, 1, 1, 1, 1] [2021-12-28 02:48:15,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 02:48:15,488 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:48:15,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:48:15,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1852592768, now seen corresponding path program 1 times [2021-12-28 02:48:15,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:48:15,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783376394] [2021-12-28 02:48:15,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:48:15,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:48:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:48:15,708 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-28 02:48:15,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:48:15,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783376394] [2021-12-28 02:48:15,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783376394] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:48:15,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:48:15,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-28 02:48:15,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433946452] [2021-12-28 02:48:15,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:48:15,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 02:48:15,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:48:15,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 02:48:15,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-28 02:48:15,712 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 135 [2021-12-28 02:48:15,714 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 131 transitions, 547 flow. Second operand has 11 states, 11 states have (on average 109.63636363636364) internal successors, (1206), 11 states have internal predecessors, (1206), 0 states have call successors, (0), 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-28 02:48:15,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:48:15,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 135 [2021-12-28 02:48:15,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:48:16,512 INFO L129 PetriNetUnfolder]: 1295/3092 cut-off events. [2021-12-28 02:48:16,512 INFO L130 PetriNetUnfolder]: For 34143/34481 co-relation queries the response was YES. [2021-12-28 02:48:16,535 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16600 conditions, 3092 events. 1295/3092 cut-off events. For 34143/34481 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 25076 event pairs, 383 based on Foata normal form. 115/3005 useless extension candidates. Maximal degree in co-relation 16564. Up to 1043 conditions per place. [2021-12-28 02:48:16,553 INFO L132 encePairwiseOnDemand]: 121/135 looper letters, 28 selfloop transitions, 16 changer transitions 54/193 dead transitions. [2021-12-28 02:48:16,553 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 193 transitions, 1509 flow [2021-12-28 02:48:16,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-28 02:48:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-28 02:48:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2021 transitions. [2021-12-28 02:48:16,559 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8316872427983539 [2021-12-28 02:48:16,559 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2021 transitions. [2021-12-28 02:48:16,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2021 transitions. [2021-12-28 02:48:16,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:48:16,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2021 transitions. [2021-12-28 02:48:16,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 112.27777777777777) internal successors, (2021), 18 states have internal predecessors, (2021), 0 states have call successors, (0), 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-28 02:48:16,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 135.0) internal successors, (2565), 19 states have internal predecessors, (2565), 0 states have call successors, (0), 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-28 02:48:16,571 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 135.0) internal successors, (2565), 19 states have internal predecessors, (2565), 0 states have call successors, (0), 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-28 02:48:16,572 INFO L186 Difference]: Start difference. First operand has 174 places, 131 transitions, 547 flow. Second operand 18 states and 2021 transitions. [2021-12-28 02:48:16,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 193 transitions, 1509 flow [2021-12-28 02:48:16,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 193 transitions, 1444 flow, removed 17 selfloop flow, removed 8 redundant places. [2021-12-28 02:48:16,605 INFO L242 Difference]: Finished difference. Result has 188 places, 134 transitions, 666 flow [2021-12-28 02:48:16,606 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=666, PETRI_PLACES=188, PETRI_TRANSITIONS=134} [2021-12-28 02:48:16,606 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 46 predicate places. [2021-12-28 02:48:16,606 INFO L470 AbstractCegarLoop]: Abstraction has has 188 places, 134 transitions, 666 flow [2021-12-28 02:48:16,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 109.63636363636364) internal successors, (1206), 11 states have internal predecessors, (1206), 0 states have call successors, (0), 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-28 02:48:16,607 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:48:16,607 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, 1, 1, 1, 1, 1, 1] [2021-12-28 02:48:16,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 02:48:16,608 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:48:16,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:48:16,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1657033784, now seen corresponding path program 1 times [2021-12-28 02:48:16,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:48:16,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89725006] [2021-12-28 02:48:16,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:48:16,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:48:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:48:16,946 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-28 02:48:16,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:48:16,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89725006] [2021-12-28 02:48:16,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89725006] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:48:16,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:48:16,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-28 02:48:16,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238134549] [2021-12-28 02:48:16,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:48:16,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 02:48:16,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:48:16,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 02:48:16,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-12-28 02:48:16,953 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 135 [2021-12-28 02:48:16,954 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 134 transitions, 666 flow. Second operand has 14 states, 14 states have (on average 108.42857142857143) internal successors, (1518), 14 states have internal predecessors, (1518), 0 states have call successors, (0), 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-28 02:48:16,954 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:48:16,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 135 [2021-12-28 02:48:16,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:48:17,737 INFO L129 PetriNetUnfolder]: 733/2038 cut-off events. [2021-12-28 02:48:17,737 INFO L130 PetriNetUnfolder]: For 29142/29384 co-relation queries the response was YES. [2021-12-28 02:48:17,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11202 conditions, 2038 events. 733/2038 cut-off events. For 29142/29384 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 15631 event pairs, 243 based on Foata normal form. 31/1941 useless extension candidates. Maximal degree in co-relation 11158. Up to 944 conditions per place. [2021-12-28 02:48:17,774 INFO L132 encePairwiseOnDemand]: 122/135 looper letters, 36 selfloop transitions, 15 changer transitions 26/171 dead transitions. [2021-12-28 02:48:17,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 171 transitions, 1322 flow [2021-12-28 02:48:17,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-28 02:48:17,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-12-28 02:48:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2100 transitions. [2021-12-28 02:48:17,780 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8187134502923976 [2021-12-28 02:48:17,780 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2100 transitions. [2021-12-28 02:48:17,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2100 transitions. [2021-12-28 02:48:17,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:48:17,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2100 transitions. [2021-12-28 02:48:17,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 110.52631578947368) internal successors, (2100), 19 states have internal predecessors, (2100), 0 states have call successors, (0), 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-28 02:48:17,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 135.0) internal successors, (2700), 20 states have internal predecessors, (2700), 0 states have call successors, (0), 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-28 02:48:17,792 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 135.0) internal successors, (2700), 20 states have internal predecessors, (2700), 0 states have call successors, (0), 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-28 02:48:17,792 INFO L186 Difference]: Start difference. First operand has 188 places, 134 transitions, 666 flow. Second operand 19 states and 2100 transitions. [2021-12-28 02:48:17,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 171 transitions, 1322 flow [2021-12-28 02:48:17,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 171 transitions, 1161 flow, removed 71 selfloop flow, removed 12 redundant places. [2021-12-28 02:48:17,824 INFO L242 Difference]: Finished difference. Result has 196 places, 136 transitions, 676 flow [2021-12-28 02:48:17,824 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=676, PETRI_PLACES=196, PETRI_TRANSITIONS=136} [2021-12-28 02:48:17,825 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 54 predicate places. [2021-12-28 02:48:17,825 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 136 transitions, 676 flow [2021-12-28 02:48:17,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 108.42857142857143) internal successors, (1518), 14 states have internal predecessors, (1518), 0 states have call successors, (0), 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-28 02:48:17,826 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:48:17,827 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:48:17,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 02:48:17,827 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:48:17,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:48:17,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1719343527, now seen corresponding path program 1 times [2021-12-28 02:48:17,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:48:17,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275164547] [2021-12-28 02:48:17,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:48:17,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:48:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:48:17,925 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-28 02:48:17,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:48:17,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275164547] [2021-12-28 02:48:17,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275164547] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:48:17,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:48:17,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:48:17,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534232649] [2021-12-28 02:48:17,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:48:17,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:48:17,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:48:17,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:48:17,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:48:17,929 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2021-12-28 02:48:17,930 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 136 transitions, 676 flow. Second operand has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 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-28 02:48:17,931 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:48:17,931 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2021-12-28 02:48:17,931 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:48:20,554 INFO L129 PetriNetUnfolder]: 10166/18106 cut-off events. [2021-12-28 02:48:20,555 INFO L130 PetriNetUnfolder]: For 246751/248997 co-relation queries the response was YES. [2021-12-28 02:48:20,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81861 conditions, 18106 events. 10166/18106 cut-off events. For 246751/248997 co-relation queries the response was YES. Maximal size of possible extension queue 1277. Compared 156857 event pairs, 676 based on Foata normal form. 269/17494 useless extension candidates. Maximal degree in co-relation 81812. Up to 6577 conditions per place. [2021-12-28 02:48:20,762 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 165 selfloop transitions, 20 changer transitions 11/295 dead transitions. [2021-12-28 02:48:20,762 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 295 transitions, 2666 flow [2021-12-28 02:48:20,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 02:48:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-28 02:48:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1182 transitions. [2021-12-28 02:48:20,765 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8755555555555555 [2021-12-28 02:48:20,766 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1182 transitions. [2021-12-28 02:48:20,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1182 transitions. [2021-12-28 02:48:20,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:48:20,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1182 transitions. [2021-12-28 02:48:20,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 118.2) internal successors, (1182), 10 states have internal predecessors, (1182), 0 states have call successors, (0), 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-28 02:48:20,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 135.0) internal successors, (1485), 11 states have internal predecessors, (1485), 0 states have call successors, (0), 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-28 02:48:20,772 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 135.0) internal successors, (1485), 11 states have internal predecessors, (1485), 0 states have call successors, (0), 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-28 02:48:20,772 INFO L186 Difference]: Start difference. First operand has 196 places, 136 transitions, 676 flow. Second operand 10 states and 1182 transitions. [2021-12-28 02:48:20,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 295 transitions, 2666 flow [2021-12-28 02:48:21,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 295 transitions, 2246 flow, removed 175 selfloop flow, removed 22 redundant places. [2021-12-28 02:48:21,063 INFO L242 Difference]: Finished difference. Result has 180 places, 154 transitions, 728 flow [2021-12-28 02:48:21,064 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=728, PETRI_PLACES=180, PETRI_TRANSITIONS=154} [2021-12-28 02:48:21,064 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 38 predicate places. [2021-12-28 02:48:21,065 INFO L470 AbstractCegarLoop]: Abstraction has has 180 places, 154 transitions, 728 flow [2021-12-28 02:48:21,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 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-28 02:48:21,065 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:48:21,065 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:48:21,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 02:48:21,066 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:48:21,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:48:21,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1718204160, now seen corresponding path program 1 times [2021-12-28 02:48:21,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:48:21,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364474854] [2021-12-28 02:48:21,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:48:21,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:48:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:48:21,169 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-28 02:48:21,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:48:21,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364474854] [2021-12-28 02:48:21,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364474854] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:48:21,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:48:21,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 02:48:21,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403978683] [2021-12-28 02:48:21,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:48:21,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 02:48:21,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:48:21,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 02:48:21,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-28 02:48:21,172 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2021-12-28 02:48:21,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 154 transitions, 728 flow. Second operand has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 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-28 02:48:21,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:48:21,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2021-12-28 02:48:21,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:48:23,682 INFO L129 PetriNetUnfolder]: 9380/17795 cut-off events. [2021-12-28 02:48:23,682 INFO L130 PetriNetUnfolder]: For 141548/143444 co-relation queries the response was YES. [2021-12-28 02:48:23,772 INFO L84 FinitePrefix]: Finished finitePrefix Result has 80592 conditions, 17795 events. 9380/17795 cut-off events. For 141548/143444 co-relation queries the response was YES. Maximal size of possible extension queue 1400. Compared 167949 event pairs, 245 based on Foata normal form. 550/17874 useless extension candidates. Maximal degree in co-relation 80553. Up to 4986 conditions per place. [2021-12-28 02:48:23,831 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 177 selfloop transitions, 38 changer transitions 30/344 dead transitions. [2021-12-28 02:48:23,831 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 344 transitions, 3002 flow [2021-12-28 02:48:23,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 02:48:23,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-28 02:48:23,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1540 transitions. [2021-12-28 02:48:23,834 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8774928774928775 [2021-12-28 02:48:23,835 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1540 transitions. [2021-12-28 02:48:23,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1540 transitions. [2021-12-28 02:48:23,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:48:23,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1540 transitions. [2021-12-28 02:48:23,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 118.46153846153847) internal successors, (1540), 13 states have internal predecessors, (1540), 0 states have call successors, (0), 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-28 02:48:23,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 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-28 02:48:23,841 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 0 states have call successors, (0), 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-28 02:48:23,841 INFO L186 Difference]: Start difference. First operand has 180 places, 154 transitions, 728 flow. Second operand 13 states and 1540 transitions. [2021-12-28 02:48:23,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 344 transitions, 3002 flow [2021-12-28 02:48:24,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 344 transitions, 3000 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-28 02:48:24,035 INFO L242 Difference]: Finished difference. Result has 197 places, 173 transitions, 1014 flow [2021-12-28 02:48:24,035 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1014, PETRI_PLACES=197, PETRI_TRANSITIONS=173} [2021-12-28 02:48:24,036 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 55 predicate places. [2021-12-28 02:48:24,037 INFO L470 AbstractCegarLoop]: Abstraction has has 197 places, 173 transitions, 1014 flow [2021-12-28 02:48:24,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 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-28 02:48:24,037 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:48:24,037 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:48:24,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 02:48:24,038 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:48:24,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:48:24,038 INFO L85 PathProgramCache]: Analyzing trace with hash -52190101, now seen corresponding path program 1 times [2021-12-28 02:48:24,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:48:24,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011878718] [2021-12-28 02:48:24,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:48:24,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:48:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:48:24,143 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-28 02:48:24,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:48:24,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011878718] [2021-12-28 02:48:24,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011878718] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:48:24,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:48:24,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:48:24,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076878788] [2021-12-28 02:48:24,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:48:24,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:48:24,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:48:24,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:48:24,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:48:24,146 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 135 [2021-12-28 02:48:24,147 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 173 transitions, 1014 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 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-28 02:48:24,147 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:48:24,147 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 135 [2021-12-28 02:48:24,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:48:26,137 INFO L129 PetriNetUnfolder]: 3585/12309 cut-off events. [2021-12-28 02:48:26,137 INFO L130 PetriNetUnfolder]: For 67010/78307 co-relation queries the response was YES. [2021-12-28 02:48:26,218 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49885 conditions, 12309 events. 3585/12309 cut-off events. For 67010/78307 co-relation queries the response was YES. Maximal size of possible extension queue 1261. Compared 158207 event pairs, 571 based on Foata normal form. 251/11639 useless extension candidates. Maximal degree in co-relation 49840. Up to 3597 conditions per place. [2021-12-28 02:48:26,249 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 66 selfloop transitions, 11 changer transitions 21/238 dead transitions. [2021-12-28 02:48:26,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 238 transitions, 2009 flow [2021-12-28 02:48:26,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 02:48:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 02:48:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1069 transitions. [2021-12-28 02:48:26,252 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8798353909465021 [2021-12-28 02:48:26,252 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1069 transitions. [2021-12-28 02:48:26,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1069 transitions. [2021-12-28 02:48:26,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:48:26,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1069 transitions. [2021-12-28 02:48:26,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 0 states have call successors, (0), 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-28 02:48:26,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 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-28 02:48:26,257 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 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-28 02:48:26,257 INFO L186 Difference]: Start difference. First operand has 197 places, 173 transitions, 1014 flow. Second operand 9 states and 1069 transitions. [2021-12-28 02:48:26,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 238 transitions, 2009 flow [2021-12-28 02:48:26,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 238 transitions, 1906 flow, removed 42 selfloop flow, removed 4 redundant places. [2021-12-28 02:48:26,880 INFO L242 Difference]: Finished difference. Result has 208 places, 181 transitions, 1070 flow [2021-12-28 02:48:26,881 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1070, PETRI_PLACES=208, PETRI_TRANSITIONS=181} [2021-12-28 02:48:26,881 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 66 predicate places. [2021-12-28 02:48:26,881 INFO L470 AbstractCegarLoop]: Abstraction has has 208 places, 181 transitions, 1070 flow [2021-12-28 02:48:26,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 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-28 02:48:26,882 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:48:26,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:48:26,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 02:48:26,882 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:48:26,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:48:26,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1600780964, now seen corresponding path program 1 times [2021-12-28 02:48:26,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:48:26,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493859717] [2021-12-28 02:48:26,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:48:26,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:48:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:48:27,003 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-28 02:48:27,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:48:27,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493859717] [2021-12-28 02:48:27,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493859717] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:48:27,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:48:27,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 02:48:27,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178294374] [2021-12-28 02:48:27,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:48:27,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 02:48:27,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:48:27,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 02:48:27,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-28 02:48:27,006 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2021-12-28 02:48:27,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 181 transitions, 1070 flow. Second operand has 8 states, 8 states have (on average 111.25) internal successors, (890), 8 states have internal predecessors, (890), 0 states have call successors, (0), 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-28 02:48:27,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:48:27,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2021-12-28 02:48:27,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:48:31,453 INFO L129 PetriNetUnfolder]: 12871/25027 cut-off events. [2021-12-28 02:48:31,454 INFO L130 PetriNetUnfolder]: For 220447/223275 co-relation queries the response was YES. [2021-12-28 02:48:31,630 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119269 conditions, 25027 events. 12871/25027 cut-off events. For 220447/223275 co-relation queries the response was YES. Maximal size of possible extension queue 2149. Compared 260993 event pairs, 106 based on Foata normal form. 763/25074 useless extension candidates. Maximal degree in co-relation 119216. Up to 4228 conditions per place. [2021-12-28 02:48:31,654 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 78 selfloop transitions, 17 changer transitions 194/386 dead transitions. [2021-12-28 02:48:31,654 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 386 transitions, 3779 flow [2021-12-28 02:48:31,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 02:48:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-28 02:48:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1896 transitions. [2021-12-28 02:48:31,657 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8777777777777778 [2021-12-28 02:48:31,657 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1896 transitions. [2021-12-28 02:48:31,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1896 transitions. [2021-12-28 02:48:31,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:48:31,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1896 transitions. [2021-12-28 02:48:31,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 118.5) internal successors, (1896), 16 states have internal predecessors, (1896), 0 states have call successors, (0), 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-28 02:48:31,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 135.0) internal successors, (2295), 17 states have internal predecessors, (2295), 0 states have call successors, (0), 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-28 02:48:31,664 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 135.0) internal successors, (2295), 17 states have internal predecessors, (2295), 0 states have call successors, (0), 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-28 02:48:31,664 INFO L186 Difference]: Start difference. First operand has 208 places, 181 transitions, 1070 flow. Second operand 16 states and 1896 transitions. [2021-12-28 02:48:31,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 386 transitions, 3779 flow [2021-12-28 02:48:32,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 386 transitions, 3712 flow, removed 23 selfloop flow, removed 2 redundant places. [2021-12-28 02:48:32,757 INFO L242 Difference]: Finished difference. Result has 227 places, 146 transitions, 846 flow [2021-12-28 02:48:32,757 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=846, PETRI_PLACES=227, PETRI_TRANSITIONS=146} [2021-12-28 02:48:32,758 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 85 predicate places. [2021-12-28 02:48:32,758 INFO L470 AbstractCegarLoop]: Abstraction has has 227 places, 146 transitions, 846 flow [2021-12-28 02:48:32,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.25) internal successors, (890), 8 states have internal predecessors, (890), 0 states have call successors, (0), 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-28 02:48:32,758 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:48:32,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:48:32,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 02:48:32,759 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:48:32,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:48:32,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1937109676, now seen corresponding path program 1 times [2021-12-28 02:48:32,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:48:32,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870343345] [2021-12-28 02:48:32,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:48:32,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:48:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:48:32,885 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-28 02:48:32,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:48:32,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870343345] [2021-12-28 02:48:32,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870343345] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:48:32,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:48:32,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 02:48:32,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085966734] [2021-12-28 02:48:32,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:48:32,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 02:48:32,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:48:32,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 02:48:32,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-28 02:48:32,889 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2021-12-28 02:48:32,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 146 transitions, 846 flow. Second operand has 9 states, 9 states have (on average 111.22222222222223) internal successors, (1001), 9 states have internal predecessors, (1001), 0 states have call successors, (0), 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-28 02:48:32,890 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:48:32,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2021-12-28 02:48:32,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:48:34,332 INFO L129 PetriNetUnfolder]: 3351/8030 cut-off events. [2021-12-28 02:48:34,332 INFO L130 PetriNetUnfolder]: For 85380/86657 co-relation queries the response was YES. [2021-12-28 02:48:34,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40619 conditions, 8030 events. 3351/8030 cut-off events. For 85380/86657 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 85061 event pairs, 73 based on Foata normal form. 221/7945 useless extension candidates. Maximal degree in co-relation 40561. Up to 1621 conditions per place. [2021-12-28 02:48:34,391 INFO L132 encePairwiseOnDemand]: 125/135 looper letters, 55 selfloop transitions, 21 changer transitions 63/236 dead transitions. [2021-12-28 02:48:34,391 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 236 transitions, 2142 flow [2021-12-28 02:48:34,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 02:48:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-28 02:48:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1616 transitions. [2021-12-28 02:48:34,394 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.855026455026455 [2021-12-28 02:48:34,394 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1616 transitions. [2021-12-28 02:48:34,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1616 transitions. [2021-12-28 02:48:34,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:48:34,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1616 transitions. [2021-12-28 02:48:34,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 115.42857142857143) internal successors, (1616), 14 states have internal predecessors, (1616), 0 states have call successors, (0), 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-28 02:48:34,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 135.0) internal successors, (2025), 15 states have internal predecessors, (2025), 0 states have call successors, (0), 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-28 02:48:34,399 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 135.0) internal successors, (2025), 15 states have internal predecessors, (2025), 0 states have call successors, (0), 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-28 02:48:34,400 INFO L186 Difference]: Start difference. First operand has 227 places, 146 transitions, 846 flow. Second operand 14 states and 1616 transitions. [2021-12-28 02:48:34,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 236 transitions, 2142 flow [2021-12-28 02:48:35,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 236 transitions, 1776 flow, removed 144 selfloop flow, removed 33 redundant places. [2021-12-28 02:48:35,010 INFO L242 Difference]: Finished difference. Result has 193 places, 142 transitions, 670 flow [2021-12-28 02:48:35,010 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=670, PETRI_PLACES=193, PETRI_TRANSITIONS=142} [2021-12-28 02:48:35,010 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 51 predicate places. [2021-12-28 02:48:35,011 INFO L470 AbstractCegarLoop]: Abstraction has has 193 places, 142 transitions, 670 flow [2021-12-28 02:48:35,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.22222222222223) internal successors, (1001), 9 states have internal predecessors, (1001), 0 states have call successors, (0), 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-28 02:48:35,011 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:48:35,011 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:48:35,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 02:48:35,012 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:48:35,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:48:35,012 INFO L85 PathProgramCache]: Analyzing trace with hash 986246620, now seen corresponding path program 1 times [2021-12-28 02:48:35,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:48:35,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085675596] [2021-12-28 02:48:35,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:48:35,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:48:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:48:35,124 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-28 02:48:35,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:48:35,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085675596] [2021-12-28 02:48:35,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085675596] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:48:35,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:48:35,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 02:48:35,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970683838] [2021-12-28 02:48:35,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:48:35,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 02:48:35,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:48:35,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 02:48:35,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 02:48:35,128 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 135 [2021-12-28 02:48:35,129 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 142 transitions, 670 flow. Second operand has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 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-28 02:48:35,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:48:35,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 135 [2021-12-28 02:48:35,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:48:36,176 INFO L129 PetriNetUnfolder]: 1680/7136 cut-off events. [2021-12-28 02:48:36,177 INFO L130 PetriNetUnfolder]: For 19792/22137 co-relation queries the response was YES. [2021-12-28 02:48:36,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22678 conditions, 7136 events. 1680/7136 cut-off events. For 19792/22137 co-relation queries the response was YES. Maximal size of possible extension queue 1057. Compared 94271 event pairs, 42 based on Foata normal form. 16/6447 useless extension candidates. Maximal degree in co-relation 22639. Up to 1611 conditions per place. [2021-12-28 02:48:36,227 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 24 selfloop transitions, 1 changer transitions 35/173 dead transitions. [2021-12-28 02:48:36,227 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 173 transitions, 1026 flow [2021-12-28 02:48:36,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 02:48:36,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-28 02:48:36,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 814 transitions. [2021-12-28 02:48:36,229 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8613756613756614 [2021-12-28 02:48:36,229 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 814 transitions. [2021-12-28 02:48:36,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 814 transitions. [2021-12-28 02:48:36,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:48:36,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 814 transitions. [2021-12-28 02:48:36,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.28571428571429) internal successors, (814), 7 states have internal predecessors, (814), 0 states have call successors, (0), 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-28 02:48:36,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 0 states have call successors, (0), 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-28 02:48:36,232 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 0 states have call successors, (0), 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-28 02:48:36,232 INFO L186 Difference]: Start difference. First operand has 193 places, 142 transitions, 670 flow. Second operand 7 states and 814 transitions. [2021-12-28 02:48:36,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 173 transitions, 1026 flow [2021-12-28 02:48:36,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 173 transitions, 750 flow, removed 88 selfloop flow, removed 29 redundant places. [2021-12-28 02:48:36,544 INFO L242 Difference]: Finished difference. Result has 171 places, 136 transitions, 456 flow [2021-12-28 02:48:36,545 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=456, PETRI_PLACES=171, PETRI_TRANSITIONS=136} [2021-12-28 02:48:36,545 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 29 predicate places. [2021-12-28 02:48:36,545 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 136 transitions, 456 flow [2021-12-28 02:48:36,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 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-28 02:48:36,546 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:48:36,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:48:36,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 02:48:36,546 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:48:36,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:48:36,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1386893046, now seen corresponding path program 2 times [2021-12-28 02:48:36,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:48:36,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11376281] [2021-12-28 02:48:36,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:48:36,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:48:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 02:48:36,590 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 02:48:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 02:48:36,698 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 02:48:36,698 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 02:48:36,699 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-28 02:48:36,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-28 02:48:36,702 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-28 02:48:36,705 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-28 02:48:36,705 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-28 02:48:36,705 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-12-28 02:48:36,705 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-28 02:48:36,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 02:48:36,709 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:48:36,713 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-28 02:48:36,713 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 02:48:36,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 02:48:36 BasicIcfg [2021-12-28 02:48:36,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 02:48:36,876 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 02:48:36,876 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 02:48:36,877 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 02:48:36,877 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:48:05" (3/4) ... [2021-12-28 02:48:36,879 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-28 02:48:37,058 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 02:48:37,058 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 02:48:37,059 INFO L158 Benchmark]: Toolchain (without parser) took 33051.95ms. Allocated memory was 56.6MB in the beginning and 9.3GB in the end (delta: 9.2GB). Free memory was 33.9MB in the beginning and 9.1GB in the end (delta: -9.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2021-12-28 02:48:37,059 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 56.6MB. Free memory was 37.9MB in the beginning and 37.9MB in the end (delta: 30.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 02:48:37,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.76ms. Allocated memory was 56.6MB in the beginning and 77.6MB in the end (delta: 21.0MB). Free memory was 33.6MB in the beginning and 56.4MB in the end (delta: -22.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-28 02:48:37,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.70ms. Allocated memory is still 77.6MB. Free memory was 56.4MB in the beginning and 53.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 02:48:37,060 INFO L158 Benchmark]: Boogie Preprocessor took 51.53ms. Allocated memory is still 77.6MB. Free memory was 53.4MB in the beginning and 51.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-28 02:48:37,060 INFO L158 Benchmark]: RCFGBuilder took 1026.63ms. Allocated memory is still 77.6MB. Free memory was 51.1MB in the beginning and 32.8MB in the end (delta: 18.3MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2021-12-28 02:48:37,060 INFO L158 Benchmark]: TraceAbstraction took 31102.85ms. Allocated memory was 77.6MB in the beginning and 9.3GB in the end (delta: 9.2GB). Free memory was 32.4MB in the beginning and 7.8GB in the end (delta: -7.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2021-12-28 02:48:37,061 INFO L158 Benchmark]: Witness Printer took 182.23ms. Allocated memory is still 9.3GB. Free memory was 7.8GB in the beginning and 9.1GB in the end (delta: -1.2GB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2021-12-28 02:48:37,062 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.19ms. Allocated memory is still 56.6MB. Free memory was 37.9MB in the beginning and 37.9MB in the end (delta: 30.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 596.76ms. Allocated memory was 56.6MB in the beginning and 77.6MB in the end (delta: 21.0MB). Free memory was 33.6MB in the beginning and 56.4MB in the end (delta: -22.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.70ms. Allocated memory is still 77.6MB. Free memory was 56.4MB in the beginning and 53.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.53ms. Allocated memory is still 77.6MB. Free memory was 53.4MB in the beginning and 51.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1026.63ms. Allocated memory is still 77.6MB. Free memory was 51.1MB in the beginning and 32.8MB in the end (delta: 18.3MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31102.85ms. Allocated memory was 77.6MB in the beginning and 9.3GB in the end (delta: 9.2GB). Free memory was 32.4MB in the beginning and 7.8GB in the end (delta: -7.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 182.23ms. Allocated memory is still 9.3GB. Free memory was 7.8GB in the beginning and 9.1GB in the end (delta: -1.2GB). Peak memory consumption was 35.7MB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L724] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L725] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L726] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L727] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L728] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L729] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L734] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L735] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L736] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L737] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L738] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L739] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L740] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L742] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L844] 0 pthread_t t805; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t805={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L845] FCALL, FORK 0 pthread_create(&t805, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t805, ((void *)0), P0, ((void *)0))=9, t805={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L846] 0 pthread_t t806; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t805={5:0}, t806={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L847] FCALL, FORK 0 pthread_create(&t806, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t806, ((void *)0), P1, ((void *)0))=10, t805={5:0}, t806={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L848] 0 pthread_t t807; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t805={5:0}, t806={6:0}, t807={7: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L849] FCALL, FORK 0 pthread_create(&t807, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t807, ((void *)0), P2, ((void *)0))=11, t805={5:0}, t806={6:0}, t807={7: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L850] 0 pthread_t t808; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t805={5:0}, t806={6:0}, t807={7:0}, t808={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L851] FCALL, FORK 0 pthread_create(&t808, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t808, ((void *)0), P3, ((void *)0))=12, t805={5:0}, t806={6:0}, t807={7:0}, t808={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L796] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L813] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L816] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L769] 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) [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L769] 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) [L769] 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) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 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 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 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 [L799] 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) [L799] 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) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 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 [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 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 [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t805={5:0}, t806={6:0}, t807={7:0}, t808={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L857] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L857] 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) [L857] 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) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L859] 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 [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 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 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 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) [L868] 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) [L869] 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)) [L869] 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)) [L870] 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)) [L870] 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)) [L871] 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)) [L871] 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)) [L872] 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)) [L872] 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)) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t805={5:0}, t806={6:0}, t807={7:0}, t808={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1034 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1034 mSDsluCounter, 680 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1387 mSDsCounter, 301 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2270 IncrementalHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 301 mSolverCounterUnsat, 145 mSDtfsCounter, 2270 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1070occurred in iteration=13, InterpolantAutomatonStates: 189, 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.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1548 NumberOfCodeBlocks, 1548 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1428 ConstructedInterpolants, 0 QuantifiedInterpolants, 6985 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-28 02:48:37,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE