./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 ff03de63 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-ff03de6 [2021-12-21 15:03:04,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 15:03:04,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 15:03:04,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 15:03:04,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 15:03:04,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 15:03:04,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 15:03:04,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 15:03:04,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 15:03:04,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 15:03:04,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 15:03:04,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 15:03:04,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 15:03:04,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 15:03:04,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 15:03:04,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 15:03:04,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 15:03:04,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 15:03:04,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 15:03:04,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 15:03:04,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 15:03:04,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 15:03:04,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 15:03:04,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 15:03:04,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 15:03:04,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 15:03:04,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 15:03:04,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 15:03:04,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 15:03:04,925 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 15:03:04,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 15:03:04,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 15:03:04,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 15:03:04,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 15:03:04,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 15:03:04,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 15:03:04,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 15:03:04,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 15:03:04,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 15:03:04,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 15:03:04,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 15:03:04,933 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 15:03:04,957 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 15:03:04,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 15:03:04,960 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 15:03:04,960 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 15:03:04,960 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 15:03:04,961 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 15:03:04,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 15:03:04,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 15:03:04,961 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 15:03:04,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 15:03:04,962 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 15:03:04,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 15:03:04,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 15:03:04,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 15:03:04,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 15:03:04,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 15:03:04,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 15:03:04,963 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 15:03:04,963 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 15:03:04,963 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 15:03:04,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 15:03:04,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 15:03:04,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 15:03:04,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 15:03:04,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:03:04,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 15:03:04,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 15:03:04,965 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 15:03:04,965 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 15:03:04,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 15:03:04,965 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 15:03:04,965 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 15:03:04,965 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 15:03:04,966 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 15:03:04,966 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-21 15:03:05,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 15:03:05,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 15:03:05,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 15:03:05,380 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 15:03:05,381 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 15:03:05,382 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-21 15:03:05,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea8e6dc2b/ccd81860bba34feea287420e6bc6f566/FLAG76b42aa42 [2021-12-21 15:03:06,164 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 15:03:06,168 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2021-12-21 15:03:06,188 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea8e6dc2b/ccd81860bba34feea287420e6bc6f566/FLAG76b42aa42 [2021-12-21 15:03:06,202 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea8e6dc2b/ccd81860bba34feea287420e6bc6f566 [2021-12-21 15:03:06,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 15:03:06,206 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 15:03:06,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 15:03:06,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 15:03:06,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 15:03:06,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:03:06" (1/1) ... [2021-12-21 15:03:06,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff9474a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:06, skipping insertion in model container [2021-12-21 15:03:06,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:03:06" (1/1) ... [2021-12-21 15:03:06,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 15:03:06,255 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 15:03:06,512 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-21 15:03:06,863 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:03:06,884 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 15:03:06,904 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-21 15:03:06,989 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:03:07,056 INFO L208 MainTranslator]: Completed translation [2021-12-21 15:03:07,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:07 WrapperNode [2021-12-21 15:03:07,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 15:03:07,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 15:03:07,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 15:03:07,058 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 15:03:07,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:07" (1/1) ... [2021-12-21 15:03:07,099 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:07" (1/1) ... [2021-12-21 15:03:07,161 INFO L137 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 290 [2021-12-21 15:03:07,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 15:03:07,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 15:03:07,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 15:03:07,169 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 15:03:07,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:07" (1/1) ... [2021-12-21 15:03:07,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:07" (1/1) ... [2021-12-21 15:03:07,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:07" (1/1) ... [2021-12-21 15:03:07,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:07" (1/1) ... [2021-12-21 15:03:07,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:07" (1/1) ... [2021-12-21 15:03:07,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:07" (1/1) ... [2021-12-21 15:03:07,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:07" (1/1) ... [2021-12-21 15:03:07,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 15:03:07,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 15:03:07,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 15:03:07,231 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 15:03:07,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:07" (1/1) ... [2021-12-21 15:03:07,272 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:03:07,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:03:07,329 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-21 15:03:07,357 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-21 15:03:07,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 15:03:07,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-21 15:03:07,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 15:03:07,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 15:03:07,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 15:03:07,384 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-21 15:03:07,385 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-21 15:03:07,385 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-21 15:03:07,386 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-21 15:03:07,386 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-21 15:03:07,386 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-21 15:03:07,386 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-12-21 15:03:07,386 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-12-21 15:03:07,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 15:03:07,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-21 15:03:07,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 15:03:07,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 15:03:07,390 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-21 15:03:07,580 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 15:03:07,581 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 15:03:08,226 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 15:03:08,671 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 15:03:08,672 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 15:03:08,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:03:08 BoogieIcfgContainer [2021-12-21 15:03:08,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 15:03:08,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 15:03:08,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 15:03:08,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 15:03:08,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:03:06" (1/3) ... [2021-12-21 15:03:08,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3944381c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:03:08, skipping insertion in model container [2021-12-21 15:03:08,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:03:07" (2/3) ... [2021-12-21 15:03:08,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3944381c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:03:08, skipping insertion in model container [2021-12-21 15:03:08,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:03:08" (3/3) ... [2021-12-21 15:03:08,682 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_power.opt_pso.opt_rmo.opt.i [2021-12-21 15:03:08,688 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-21 15:03:08,688 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 15:03:08,688 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-21 15:03:08,689 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-21 15:03:08,733 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,733 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,734 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,734 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,734 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,734 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,735 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,735 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,735 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,736 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,736 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,736 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,736 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,737 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,737 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,737 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,737 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,738 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,738 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,738 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,739 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,739 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,739 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,739 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,739 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,740 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,740 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,740 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,740 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,740 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,741 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,741 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,741 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,741 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,742 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,742 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,742 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,743 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,743 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,743 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,743 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,743 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,743 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,744 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,744 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,744 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,744 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,744 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,744 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,745 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,745 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,745 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,745 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,745 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,745 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,746 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,746 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,746 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,746 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,746 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,747 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,747 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,747 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,747 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,747 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,748 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,748 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,748 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,748 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,749 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,749 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,749 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,749 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,750 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,750 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,752 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,752 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,753 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,753 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,753 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,753 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,754 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,754 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,754 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,758 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,759 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,759 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,759 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,759 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,759 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,759 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,760 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,760 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,761 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,761 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,763 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,763 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,763 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,764 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,764 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,764 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,764 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,765 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,765 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,765 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,765 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,765 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,766 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,766 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,766 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,766 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,766 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,767 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,767 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,767 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,767 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,767 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,767 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,767 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,768 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,768 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,768 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,769 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,769 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,770 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,770 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,770 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,770 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,770 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,770 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,770 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:03:08,771 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-21 15:03:08,820 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 15:03:08,826 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-21 15:03:08,827 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-21 15:03:08,838 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 290 flow [2021-12-21 15:03:08,891 INFO L129 PetriNetUnfolder]: 2/131 cut-off events. [2021-12-21 15:03:08,892 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-21 15:03:08,896 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-21 15:03:08,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 135 transitions, 290 flow [2021-12-21 15:03:08,903 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 131 transitions, 274 flow [2021-12-21 15:03:08,922 INFO L129 PetriNetUnfolder]: 0/77 cut-off events. [2021-12-21 15:03:08,923 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-21 15:03:08,923 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:08,924 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-21 15:03:08,924 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-21 15:03:08,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:08,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1442612500, now seen corresponding path program 1 times [2021-12-21 15:03:08,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:08,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794714763] [2021-12-21 15:03:08,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:08,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:09,187 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-21 15:03:09,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:09,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794714763] [2021-12-21 15:03:09,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794714763] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:09,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:09,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 15:03:09,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633489795] [2021-12-21 15:03:09,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:09,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 15:03:09,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:09,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 15:03:09,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 15:03:09,226 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 135 [2021-12-21 15:03:09,231 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-21 15:03:09,231 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:09,231 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 135 [2021-12-21 15:03:09,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:09,343 INFO L129 PetriNetUnfolder]: 57/361 cut-off events. [2021-12-21 15:03:09,343 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-12-21 15:03:09,345 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-21 15:03:09,347 INFO L132 encePairwiseOnDemand]: 130/135 looper letters, 14 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2021-12-21 15:03:09,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 132 transitions, 311 flow [2021-12-21 15:03:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 15:03:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-21 15:03:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2021-12-21 15:03:09,358 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9407407407407408 [2021-12-21 15:03:09,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2021-12-21 15:03:09,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2021-12-21 15:03:09,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:09,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2021-12-21 15:03:09,367 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-21 15:03:09,382 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-21 15:03:09,382 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-21 15:03:09,384 INFO L186 Difference]: Start difference. First operand has 142 places, 131 transitions, 274 flow. Second operand 3 states and 381 transitions. [2021-12-21 15:03:09,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 132 transitions, 311 flow [2021-12-21 15:03:09,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 132 transitions, 306 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-21 15:03:09,392 INFO L242 Difference]: Finished difference. Result has 138 places, 127 transitions, 266 flow [2021-12-21 15:03:09,393 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-21 15:03:09,396 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, -4 predicate places. [2021-12-21 15:03:09,411 INFO L470 AbstractCegarLoop]: Abstraction has has 138 places, 127 transitions, 266 flow [2021-12-21 15:03:09,412 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-21 15:03:09,412 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:09,412 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-21 15:03:09,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 15:03:09,413 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-21 15:03:09,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:09,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1620607474, now seen corresponding path program 1 times [2021-12-21 15:03:09,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:09,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157111119] [2021-12-21 15:03:09,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:09,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:09,674 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-21 15:03:09,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:09,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157111119] [2021-12-21 15:03:09,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157111119] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:09,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:09,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:03:09,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720313950] [2021-12-21 15:03:09,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:09,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:03:09,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:09,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:03:09,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:03:09,681 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 135 [2021-12-21 15:03:09,682 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-21 15:03:09,682 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:09,682 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 135 [2021-12-21 15:03:09,682 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:10,105 INFO L129 PetriNetUnfolder]: 724/2188 cut-off events. [2021-12-21 15:03:10,105 INFO L130 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2021-12-21 15:03:10,113 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-21 15:03:10,120 INFO L132 encePairwiseOnDemand]: 128/135 looper letters, 22 selfloop transitions, 3 changer transitions 56/175 dead transitions. [2021-12-21 15:03:10,120 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 175 transitions, 514 flow [2021-12-21 15:03:10,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:03:10,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-21 15:03:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1069 transitions. [2021-12-21 15:03:10,123 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8798353909465021 [2021-12-21 15:03:10,124 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1069 transitions. [2021-12-21 15:03:10,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1069 transitions. [2021-12-21 15:03:10,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:10,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1069 transitions. [2021-12-21 15:03:10,126 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-21 15:03:10,129 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-21 15:03:10,129 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-21 15:03:10,130 INFO L186 Difference]: Start difference. First operand has 138 places, 127 transitions, 266 flow. Second operand 9 states and 1069 transitions. [2021-12-21 15:03:10,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 175 transitions, 514 flow [2021-12-21 15:03:10,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 175 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-21 15:03:10,149 INFO L242 Difference]: Finished difference. Result has 151 places, 115 transitions, 277 flow [2021-12-21 15:03:10,149 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-21 15:03:10,150 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 9 predicate places. [2021-12-21 15:03:10,150 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 115 transitions, 277 flow [2021-12-21 15:03:10,151 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-21 15:03:10,151 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:10,151 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-21 15:03:10,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 15:03:10,151 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-21 15:03:10,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:10,152 INFO L85 PathProgramCache]: Analyzing trace with hash -256106927, now seen corresponding path program 1 times [2021-12-21 15:03:10,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:10,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306318014] [2021-12-21 15:03:10,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:10,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:10,365 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-21 15:03:10,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:10,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306318014] [2021-12-21 15:03:10,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306318014] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:10,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:10,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 15:03:10,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118997464] [2021-12-21 15:03:10,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:10,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 15:03:10,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:10,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 15:03:10,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-21 15:03:10,370 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 135 [2021-12-21 15:03:10,371 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-21 15:03:10,371 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:10,371 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 135 [2021-12-21 15:03:10,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:10,793 INFO L129 PetriNetUnfolder]: 496/1182 cut-off events. [2021-12-21 15:03:10,793 INFO L130 PetriNetUnfolder]: For 798/801 co-relation queries the response was YES. [2021-12-21 15:03:10,798 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-21 15:03:10,803 INFO L132 encePairwiseOnDemand]: 122/135 looper letters, 20 selfloop transitions, 12 changer transitions 43/170 dead transitions. [2021-12-21 15:03:10,803 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 170 transitions, 571 flow [2021-12-21 15:03:10,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 15:03:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-21 15:03:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1728 transitions. [2021-12-21 15:03:10,806 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8533333333333334 [2021-12-21 15:03:10,806 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1728 transitions. [2021-12-21 15:03:10,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1728 transitions. [2021-12-21 15:03:10,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:10,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1728 transitions. [2021-12-21 15:03:10,810 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-21 15:03:10,813 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-21 15:03:10,813 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-21 15:03:10,813 INFO L186 Difference]: Start difference. First operand has 151 places, 115 transitions, 277 flow. Second operand 15 states and 1728 transitions. [2021-12-21 15:03:10,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 170 transitions, 571 flow [2021-12-21 15:03:10,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 170 transitions, 550 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-12-21 15:03:10,820 INFO L242 Difference]: Finished difference. Result has 152 places, 123 transitions, 366 flow [2021-12-21 15:03:10,820 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-21 15:03:10,821 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 10 predicate places. [2021-12-21 15:03:10,821 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 123 transitions, 366 flow [2021-12-21 15:03:10,821 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-21 15:03:10,821 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:10,822 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-21 15:03:10,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 15:03:10,822 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-21 15:03:10,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:10,822 INFO L85 PathProgramCache]: Analyzing trace with hash 628173759, now seen corresponding path program 1 times [2021-12-21 15:03:10,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:10,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465421624] [2021-12-21 15:03:10,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:10,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:10,916 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-21 15:03:10,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:10,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465421624] [2021-12-21 15:03:10,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465421624] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:10,916 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:10,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:03:10,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638939713] [2021-12-21 15:03:10,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:10,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:03:10,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:10,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:03:10,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:03:10,918 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 135 [2021-12-21 15:03:10,919 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-21 15:03:10,919 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:10,919 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 135 [2021-12-21 15:03:10,919 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:11,347 INFO L129 PetriNetUnfolder]: 872/1978 cut-off events. [2021-12-21 15:03:11,347 INFO L130 PetriNetUnfolder]: For 5202/5670 co-relation queries the response was YES. [2021-12-21 15:03:11,358 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-21 15:03:11,367 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 54 selfloop transitions, 12 changer transitions 9/171 dead transitions. [2021-12-21 15:03:11,368 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 171 transitions, 786 flow [2021-12-21 15:03:11,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:03:11,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-21 15:03:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1065 transitions. [2021-12-21 15:03:11,370 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8765432098765432 [2021-12-21 15:03:11,370 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1065 transitions. [2021-12-21 15:03:11,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1065 transitions. [2021-12-21 15:03:11,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:11,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1065 transitions. [2021-12-21 15:03:11,372 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-21 15:03:11,374 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-21 15:03:11,374 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-21 15:03:11,374 INFO L186 Difference]: Start difference. First operand has 152 places, 123 transitions, 366 flow. Second operand 9 states and 1065 transitions. [2021-12-21 15:03:11,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 171 transitions, 786 flow [2021-12-21 15:03:11,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 171 transitions, 754 flow, removed 14 selfloop flow, removed 5 redundant places. [2021-12-21 15:03:11,383 INFO L242 Difference]: Finished difference. Result has 153 places, 132 transitions, 486 flow [2021-12-21 15:03:11,383 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-21 15:03:11,383 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 11 predicate places. [2021-12-21 15:03:11,384 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 132 transitions, 486 flow [2021-12-21 15:03:11,384 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-21 15:03:11,384 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:11,384 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-21 15:03:11,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 15:03:11,384 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-21 15:03:11,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:11,385 INFO L85 PathProgramCache]: Analyzing trace with hash -838440047, now seen corresponding path program 1 times [2021-12-21 15:03:11,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:11,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427918849] [2021-12-21 15:03:11,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:11,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:11,504 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-21 15:03:11,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:11,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427918849] [2021-12-21 15:03:11,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427918849] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:11,508 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:11,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:03:11,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706339484] [2021-12-21 15:03:11,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:11,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:03:11,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:11,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:03:11,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:03:11,510 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 135 [2021-12-21 15:03:11,511 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-21 15:03:11,512 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:11,512 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 135 [2021-12-21 15:03:11,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:11,966 INFO L129 PetriNetUnfolder]: 916/2183 cut-off events. [2021-12-21 15:03:11,966 INFO L130 PetriNetUnfolder]: For 8970/9210 co-relation queries the response was YES. [2021-12-21 15:03:11,981 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-21 15:03:11,989 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 40 selfloop transitions, 21 changer transitions 15/179 dead transitions. [2021-12-21 15:03:11,990 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 179 transitions, 996 flow [2021-12-21 15:03:11,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:03:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-21 15:03:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1071 transitions. [2021-12-21 15:03:12,021 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8814814814814815 [2021-12-21 15:03:12,021 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1071 transitions. [2021-12-21 15:03:12,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1071 transitions. [2021-12-21 15:03:12,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:12,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1071 transitions. [2021-12-21 15:03:12,023 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-21 15:03:12,024 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-21 15:03:12,025 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-21 15:03:12,025 INFO L186 Difference]: Start difference. First operand has 153 places, 132 transitions, 486 flow. Second operand 9 states and 1071 transitions. [2021-12-21 15:03:12,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 179 transitions, 996 flow [2021-12-21 15:03:12,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 179 transitions, 921 flow, removed 36 selfloop flow, removed 1 redundant places. [2021-12-21 15:03:12,042 INFO L242 Difference]: Finished difference. Result has 163 places, 149 transitions, 655 flow [2021-12-21 15:03:12,042 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-21 15:03:12,044 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 21 predicate places. [2021-12-21 15:03:12,044 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 149 transitions, 655 flow [2021-12-21 15:03:12,045 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-21 15:03:12,045 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:12,045 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-21 15:03:12,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 15:03:12,045 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-21 15:03:12,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:12,046 INFO L85 PathProgramCache]: Analyzing trace with hash -64510759, now seen corresponding path program 1 times [2021-12-21 15:03:12,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:12,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885780535] [2021-12-21 15:03:12,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:12,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:12,173 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-21 15:03:12,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:12,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885780535] [2021-12-21 15:03:12,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885780535] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:12,173 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:12,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:03:12,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602810087] [2021-12-21 15:03:12,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:12,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:03:12,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:12,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:03:12,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:03:12,176 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 135 [2021-12-21 15:03:12,177 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-21 15:03:12,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:12,177 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 135 [2021-12-21 15:03:12,177 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:13,586 INFO L129 PetriNetUnfolder]: 4721/9120 cut-off events. [2021-12-21 15:03:13,587 INFO L130 PetriNetUnfolder]: For 37246/37941 co-relation queries the response was YES. [2021-12-21 15:03:13,640 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-21 15:03:13,663 INFO L132 encePairwiseOnDemand]: 128/135 looper letters, 55 selfloop transitions, 3 changer transitions 75/238 dead transitions. [2021-12-21 15:03:13,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 238 transitions, 1641 flow [2021-12-21 15:03:13,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:03:13,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-21 15:03:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1077 transitions. [2021-12-21 15:03:13,667 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8864197530864197 [2021-12-21 15:03:13,667 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1077 transitions. [2021-12-21 15:03:13,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1077 transitions. [2021-12-21 15:03:13,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:13,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1077 transitions. [2021-12-21 15:03:13,669 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-21 15:03:13,671 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-21 15:03:13,671 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-21 15:03:13,671 INFO L186 Difference]: Start difference. First operand has 163 places, 149 transitions, 655 flow. Second operand 9 states and 1077 transitions. [2021-12-21 15:03:13,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 238 transitions, 1641 flow [2021-12-21 15:03:13,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 238 transitions, 1625 flow, removed 8 selfloop flow, removed 0 redundant places. [2021-12-21 15:03:13,926 INFO L242 Difference]: Finished difference. Result has 178 places, 151 transitions, 760 flow [2021-12-21 15:03:13,926 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-21 15:03:13,927 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 36 predicate places. [2021-12-21 15:03:13,927 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 151 transitions, 760 flow [2021-12-21 15:03:13,936 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-21 15:03:13,936 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:13,937 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-21 15:03:13,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 15:03:13,938 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-21 15:03:13,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:13,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1605402989, now seen corresponding path program 1 times [2021-12-21 15:03:13,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:13,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37127702] [2021-12-21 15:03:13,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:13,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:14,167 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-21 15:03:14,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:14,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37127702] [2021-12-21 15:03:14,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37127702] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:14,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:14,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 15:03:14,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387556232] [2021-12-21 15:03:14,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:14,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 15:03:14,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:14,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 15:03:14,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-21 15:03:14,173 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2021-12-21 15:03:14,174 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-21 15:03:14,174 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:14,174 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2021-12-21 15:03:14,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:15,547 INFO L129 PetriNetUnfolder]: 2881/5699 cut-off events. [2021-12-21 15:03:15,547 INFO L130 PetriNetUnfolder]: For 41756/42083 co-relation queries the response was YES. [2021-12-21 15:03:15,586 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-21 15:03:15,610 INFO L132 encePairwiseOnDemand]: 123/135 looper letters, 38 selfloop transitions, 11 changer transitions 81/226 dead transitions. [2021-12-21 15:03:15,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 226 transitions, 1762 flow [2021-12-21 15:03:15,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 15:03:15,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-21 15:03:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1825 transitions. [2021-12-21 15:03:15,614 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8449074074074074 [2021-12-21 15:03:15,614 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1825 transitions. [2021-12-21 15:03:15,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1825 transitions. [2021-12-21 15:03:15,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:15,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1825 transitions. [2021-12-21 15:03:15,617 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-21 15:03:15,620 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-21 15:03:15,620 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-21 15:03:15,620 INFO L186 Difference]: Start difference. First operand has 178 places, 151 transitions, 760 flow. Second operand 16 states and 1825 transitions. [2021-12-21 15:03:15,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 226 transitions, 1762 flow [2021-12-21 15:03:15,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 226 transitions, 1669 flow, removed 45 selfloop flow, removed 4 redundant places. [2021-12-21 15:03:15,719 INFO L242 Difference]: Finished difference. Result has 194 places, 129 transitions, 512 flow [2021-12-21 15:03:15,719 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-21 15:03:15,720 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 52 predicate places. [2021-12-21 15:03:15,720 INFO L470 AbstractCegarLoop]: Abstraction has has 194 places, 129 transitions, 512 flow [2021-12-21 15:03:15,721 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-21 15:03:15,721 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:15,721 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-21 15:03:15,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 15:03:15,721 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-21 15:03:15,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:15,722 INFO L85 PathProgramCache]: Analyzing trace with hash -780525375, now seen corresponding path program 1 times [2021-12-21 15:03:15,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:15,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666155288] [2021-12-21 15:03:15,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:15,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:15,931 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-21 15:03:15,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:15,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666155288] [2021-12-21 15:03:15,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666155288] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:15,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:15,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 15:03:15,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548950904] [2021-12-21 15:03:15,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:15,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 15:03:15,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:15,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 15:03:15,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-21 15:03:15,934 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2021-12-21 15:03:15,935 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-21 15:03:15,935 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:15,935 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2021-12-21 15:03:15,935 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:16,675 INFO L129 PetriNetUnfolder]: 1440/3374 cut-off events. [2021-12-21 15:03:16,675 INFO L130 PetriNetUnfolder]: For 38507/38701 co-relation queries the response was YES. [2021-12-21 15:03:16,697 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-21 15:03:16,712 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 33 selfloop transitions, 11 changer transitions 31/171 dead transitions. [2021-12-21 15:03:16,712 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 171 transitions, 1155 flow [2021-12-21 15:03:16,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 15:03:16,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-21 15:03:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1482 transitions. [2021-12-21 15:03:16,716 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2021-12-21 15:03:16,716 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1482 transitions. [2021-12-21 15:03:16,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1482 transitions. [2021-12-21 15:03:16,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:16,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1482 transitions. [2021-12-21 15:03:16,719 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-21 15:03:16,721 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-21 15:03:16,721 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-21 15:03:16,721 INFO L186 Difference]: Start difference. First operand has 194 places, 129 transitions, 512 flow. Second operand 13 states and 1482 transitions. [2021-12-21 15:03:16,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 171 transitions, 1155 flow [2021-12-21 15:03:16,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 171 transitions, 1042 flow, removed 46 selfloop flow, removed 18 redundant places. [2021-12-21 15:03:16,752 INFO L242 Difference]: Finished difference. Result has 174 places, 131 transitions, 547 flow [2021-12-21 15:03:16,752 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-21 15:03:16,754 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 32 predicate places. [2021-12-21 15:03:16,754 INFO L470 AbstractCegarLoop]: Abstraction has has 174 places, 131 transitions, 547 flow [2021-12-21 15:03:16,755 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-21 15:03:16,755 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:16,755 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-21 15:03:16,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 15:03:16,755 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-21 15:03:16,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:16,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1852592768, now seen corresponding path program 1 times [2021-12-21 15:03:16,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:16,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688230868] [2021-12-21 15:03:16,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:16,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:16,912 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-21 15:03:16,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:16,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688230868] [2021-12-21 15:03:16,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688230868] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:16,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:16,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 15:03:16,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412253748] [2021-12-21 15:03:16,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:16,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 15:03:16,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:16,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 15:03:16,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-21 15:03:16,914 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 135 [2021-12-21 15:03:16,915 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-21 15:03:16,915 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:16,915 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 135 [2021-12-21 15:03:16,915 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:17,700 INFO L129 PetriNetUnfolder]: 1295/3092 cut-off events. [2021-12-21 15:03:17,700 INFO L130 PetriNetUnfolder]: For 34143/34481 co-relation queries the response was YES. [2021-12-21 15:03:17,721 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-21 15:03:17,757 INFO L132 encePairwiseOnDemand]: 121/135 looper letters, 28 selfloop transitions, 16 changer transitions 54/193 dead transitions. [2021-12-21 15:03:17,757 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 193 transitions, 1509 flow [2021-12-21 15:03:17,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-21 15:03:17,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-21 15:03:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2021 transitions. [2021-12-21 15:03:17,778 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8316872427983539 [2021-12-21 15:03:17,778 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2021 transitions. [2021-12-21 15:03:17,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2021 transitions. [2021-12-21 15:03:17,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:17,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2021 transitions. [2021-12-21 15:03:17,784 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-21 15:03:17,802 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-21 15:03:17,803 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-21 15:03:17,803 INFO L186 Difference]: Start difference. First operand has 174 places, 131 transitions, 547 flow. Second operand 18 states and 2021 transitions. [2021-12-21 15:03:17,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 193 transitions, 1509 flow [2021-12-21 15:03:17,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 193 transitions, 1444 flow, removed 17 selfloop flow, removed 8 redundant places. [2021-12-21 15:03:17,837 INFO L242 Difference]: Finished difference. Result has 188 places, 134 transitions, 666 flow [2021-12-21 15:03:17,837 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-21 15:03:17,852 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 46 predicate places. [2021-12-21 15:03:17,852 INFO L470 AbstractCegarLoop]: Abstraction has has 188 places, 134 transitions, 666 flow [2021-12-21 15:03:17,852 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-21 15:03:17,853 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:17,853 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-21 15:03:17,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 15:03:17,853 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-21 15:03:17,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:17,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1657033784, now seen corresponding path program 1 times [2021-12-21 15:03:17,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:17,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323386573] [2021-12-21 15:03:17,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:17,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:18,164 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-21 15:03:18,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:18,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323386573] [2021-12-21 15:03:18,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323386573] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:18,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:18,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-21 15:03:18,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309095878] [2021-12-21 15:03:18,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:18,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 15:03:18,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:18,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 15:03:18,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-12-21 15:03:18,167 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 135 [2021-12-21 15:03:18,169 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-21 15:03:18,169 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:18,169 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 135 [2021-12-21 15:03:18,169 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:18,845 INFO L129 PetriNetUnfolder]: 733/2038 cut-off events. [2021-12-21 15:03:18,846 INFO L130 PetriNetUnfolder]: For 29142/29384 co-relation queries the response was YES. [2021-12-21 15:03:18,864 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-21 15:03:18,949 INFO L132 encePairwiseOnDemand]: 122/135 looper letters, 36 selfloop transitions, 15 changer transitions 26/171 dead transitions. [2021-12-21 15:03:18,949 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 171 transitions, 1322 flow [2021-12-21 15:03:18,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 15:03:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-12-21 15:03:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2100 transitions. [2021-12-21 15:03:18,953 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8187134502923976 [2021-12-21 15:03:18,954 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2100 transitions. [2021-12-21 15:03:18,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2100 transitions. [2021-12-21 15:03:18,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:18,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2100 transitions. [2021-12-21 15:03:18,958 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-21 15:03:18,961 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-21 15:03:18,961 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-21 15:03:18,962 INFO L186 Difference]: Start difference. First operand has 188 places, 134 transitions, 666 flow. Second operand 19 states and 2100 transitions. [2021-12-21 15:03:18,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 171 transitions, 1322 flow [2021-12-21 15:03:18,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 171 transitions, 1161 flow, removed 71 selfloop flow, removed 12 redundant places. [2021-12-21 15:03:18,983 INFO L242 Difference]: Finished difference. Result has 196 places, 136 transitions, 676 flow [2021-12-21 15:03:18,983 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-21 15:03:18,984 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 54 predicate places. [2021-12-21 15:03:18,984 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 136 transitions, 676 flow [2021-12-21 15:03:18,985 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-21 15:03:18,985 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:18,985 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-21 15:03:18,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 15:03:18,985 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-21 15:03:18,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:18,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1719343527, now seen corresponding path program 1 times [2021-12-21 15:03:18,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:18,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798859814] [2021-12-21 15:03:18,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:18,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:19,053 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-21 15:03:19,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:19,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798859814] [2021-12-21 15:03:19,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798859814] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:19,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:19,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:03:19,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251787923] [2021-12-21 15:03:19,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:19,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:03:19,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:19,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:03:19,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:03:19,055 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2021-12-21 15:03:19,056 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-21 15:03:19,056 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:19,056 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2021-12-21 15:03:19,056 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:22,219 INFO L129 PetriNetUnfolder]: 10166/18106 cut-off events. [2021-12-21 15:03:22,219 INFO L130 PetriNetUnfolder]: For 246751/248997 co-relation queries the response was YES. [2021-12-21 15:03:22,372 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-21 15:03:22,444 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 165 selfloop transitions, 20 changer transitions 11/295 dead transitions. [2021-12-21 15:03:22,444 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 295 transitions, 2666 flow [2021-12-21 15:03:22,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:03:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 15:03:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1182 transitions. [2021-12-21 15:03:22,446 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8755555555555555 [2021-12-21 15:03:22,447 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1182 transitions. [2021-12-21 15:03:22,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1182 transitions. [2021-12-21 15:03:22,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:22,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1182 transitions. [2021-12-21 15:03:22,449 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-21 15:03:22,450 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-21 15:03:22,450 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-21 15:03:22,450 INFO L186 Difference]: Start difference. First operand has 196 places, 136 transitions, 676 flow. Second operand 10 states and 1182 transitions. [2021-12-21 15:03:22,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 295 transitions, 2666 flow [2021-12-21 15:03:22,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 295 transitions, 2246 flow, removed 175 selfloop flow, removed 22 redundant places. [2021-12-21 15:03:22,645 INFO L242 Difference]: Finished difference. Result has 180 places, 154 transitions, 728 flow [2021-12-21 15:03:22,646 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-21 15:03:22,646 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 38 predicate places. [2021-12-21 15:03:22,646 INFO L470 AbstractCegarLoop]: Abstraction has has 180 places, 154 transitions, 728 flow [2021-12-21 15:03:22,646 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-21 15:03:22,647 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:22,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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:22,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 15:03:22,647 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-21 15:03:22,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:22,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1718204160, now seen corresponding path program 1 times [2021-12-21 15:03:22,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:22,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048054632] [2021-12-21 15:03:22,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:22,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:22,715 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-21 15:03:22,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:22,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048054632] [2021-12-21 15:03:22,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048054632] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:22,716 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:22,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:03:22,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325210927] [2021-12-21 15:03:22,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:22,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:03:22,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:22,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:03:22,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:03:22,718 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2021-12-21 15:03:22,718 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-21 15:03:22,718 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:22,718 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2021-12-21 15:03:22,718 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:25,234 INFO L129 PetriNetUnfolder]: 9380/17795 cut-off events. [2021-12-21 15:03:25,234 INFO L130 PetriNetUnfolder]: For 141548/143444 co-relation queries the response was YES. [2021-12-21 15:03:25,351 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-21 15:03:25,521 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 177 selfloop transitions, 38 changer transitions 30/344 dead transitions. [2021-12-21 15:03:25,521 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 344 transitions, 3002 flow [2021-12-21 15:03:25,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 15:03:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-21 15:03:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1540 transitions. [2021-12-21 15:03:25,532 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8774928774928775 [2021-12-21 15:03:25,532 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1540 transitions. [2021-12-21 15:03:25,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1540 transitions. [2021-12-21 15:03:25,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:25,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1540 transitions. [2021-12-21 15:03:25,534 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-21 15:03:25,536 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-21 15:03:25,537 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-21 15:03:25,537 INFO L186 Difference]: Start difference. First operand has 180 places, 154 transitions, 728 flow. Second operand 13 states and 1540 transitions. [2021-12-21 15:03:25,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 344 transitions, 3002 flow [2021-12-21 15:03:25,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 344 transitions, 3000 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-21 15:03:25,770 INFO L242 Difference]: Finished difference. Result has 197 places, 173 transitions, 1014 flow [2021-12-21 15:03:25,770 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-21 15:03:25,771 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 55 predicate places. [2021-12-21 15:03:25,771 INFO L470 AbstractCegarLoop]: Abstraction has has 197 places, 173 transitions, 1014 flow [2021-12-21 15:03:25,771 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-21 15:03:25,771 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:25,771 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-21 15:03:25,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-21 15:03:25,772 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-21 15:03:25,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:25,772 INFO L85 PathProgramCache]: Analyzing trace with hash -52190101, now seen corresponding path program 1 times [2021-12-21 15:03:25,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:25,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113537763] [2021-12-21 15:03:25,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:25,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:25,846 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-21 15:03:25,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:25,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113537763] [2021-12-21 15:03:25,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113537763] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:25,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:25,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:03:25,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864738666] [2021-12-21 15:03:25,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:25,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:03:25,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:25,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:03:25,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:03:25,849 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 135 [2021-12-21 15:03:25,850 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-21 15:03:25,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:25,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 135 [2021-12-21 15:03:25,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:28,224 INFO L129 PetriNetUnfolder]: 3585/12309 cut-off events. [2021-12-21 15:03:28,225 INFO L130 PetriNetUnfolder]: For 67010/78307 co-relation queries the response was YES. [2021-12-21 15:03:28,333 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-21 15:03:28,366 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 66 selfloop transitions, 11 changer transitions 21/238 dead transitions. [2021-12-21 15:03:28,367 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 238 transitions, 2009 flow [2021-12-21 15:03:28,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:03:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-21 15:03:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1069 transitions. [2021-12-21 15:03:28,386 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8798353909465021 [2021-12-21 15:03:28,386 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1069 transitions. [2021-12-21 15:03:28,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1069 transitions. [2021-12-21 15:03:28,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:28,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1069 transitions. [2021-12-21 15:03:28,388 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-21 15:03:28,390 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-21 15:03:28,390 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-21 15:03:28,390 INFO L186 Difference]: Start difference. First operand has 197 places, 173 transitions, 1014 flow. Second operand 9 states and 1069 transitions. [2021-12-21 15:03:28,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 238 transitions, 2009 flow [2021-12-21 15:03:29,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 238 transitions, 1906 flow, removed 42 selfloop flow, removed 4 redundant places. [2021-12-21 15:03:29,151 INFO L242 Difference]: Finished difference. Result has 208 places, 181 transitions, 1070 flow [2021-12-21 15:03:29,152 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-21 15:03:29,152 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 66 predicate places. [2021-12-21 15:03:29,152 INFO L470 AbstractCegarLoop]: Abstraction has has 208 places, 181 transitions, 1070 flow [2021-12-21 15:03:29,152 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-21 15:03:29,152 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:29,153 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-21 15:03:29,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-21 15:03:29,153 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-21 15:03:29,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:29,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1600780964, now seen corresponding path program 1 times [2021-12-21 15:03:29,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:29,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724154231] [2021-12-21 15:03:29,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:29,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:29,319 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-21 15:03:29,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:29,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724154231] [2021-12-21 15:03:29,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724154231] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:29,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:29,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 15:03:29,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139304485] [2021-12-21 15:03:29,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:29,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 15:03:29,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:29,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 15:03:29,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 15:03:29,322 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2021-12-21 15:03:29,322 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-21 15:03:29,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:29,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2021-12-21 15:03:29,323 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:34,395 INFO L129 PetriNetUnfolder]: 12871/25027 cut-off events. [2021-12-21 15:03:34,396 INFO L130 PetriNetUnfolder]: For 220447/223275 co-relation queries the response was YES. [2021-12-21 15:03:34,754 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-21 15:03:34,787 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 78 selfloop transitions, 17 changer transitions 194/386 dead transitions. [2021-12-21 15:03:34,787 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 386 transitions, 3779 flow [2021-12-21 15:03:34,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 15:03:34,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-21 15:03:34,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1896 transitions. [2021-12-21 15:03:34,805 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8777777777777778 [2021-12-21 15:03:34,805 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1896 transitions. [2021-12-21 15:03:34,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1896 transitions. [2021-12-21 15:03:34,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:34,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1896 transitions. [2021-12-21 15:03:34,808 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-21 15:03:34,810 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-21 15:03:34,811 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-21 15:03:34,811 INFO L186 Difference]: Start difference. First operand has 208 places, 181 transitions, 1070 flow. Second operand 16 states and 1896 transitions. [2021-12-21 15:03:34,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 386 transitions, 3779 flow [2021-12-21 15:03:36,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 386 transitions, 3712 flow, removed 23 selfloop flow, removed 2 redundant places. [2021-12-21 15:03:36,065 INFO L242 Difference]: Finished difference. Result has 227 places, 146 transitions, 846 flow [2021-12-21 15:03:36,066 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-21 15:03:36,066 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 85 predicate places. [2021-12-21 15:03:36,066 INFO L470 AbstractCegarLoop]: Abstraction has has 227 places, 146 transitions, 846 flow [2021-12-21 15:03:36,079 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-21 15:03:36,079 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:36,080 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-21 15:03:36,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-21 15:03:36,080 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-21 15:03:36,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:36,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1937109676, now seen corresponding path program 1 times [2021-12-21 15:03:36,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:36,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465461310] [2021-12-21 15:03:36,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:36,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:36,259 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-21 15:03:36,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:36,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465461310] [2021-12-21 15:03:36,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465461310] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:36,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:36,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 15:03:36,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479174381] [2021-12-21 15:03:36,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:36,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 15:03:36,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:36,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 15:03:36,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-21 15:03:36,263 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2021-12-21 15:03:36,264 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-21 15:03:36,264 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:36,264 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2021-12-21 15:03:36,264 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:37,885 INFO L129 PetriNetUnfolder]: 3351/8030 cut-off events. [2021-12-21 15:03:37,885 INFO L130 PetriNetUnfolder]: For 85380/86657 co-relation queries the response was YES. [2021-12-21 15:03:37,940 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-21 15:03:37,950 INFO L132 encePairwiseOnDemand]: 125/135 looper letters, 55 selfloop transitions, 21 changer transitions 63/236 dead transitions. [2021-12-21 15:03:37,950 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 236 transitions, 2142 flow [2021-12-21 15:03:37,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 15:03:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-21 15:03:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1616 transitions. [2021-12-21 15:03:37,953 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.855026455026455 [2021-12-21 15:03:37,953 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1616 transitions. [2021-12-21 15:03:37,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1616 transitions. [2021-12-21 15:03:37,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:37,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1616 transitions. [2021-12-21 15:03:37,955 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-21 15:03:37,957 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-21 15:03:37,957 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-21 15:03:37,957 INFO L186 Difference]: Start difference. First operand has 227 places, 146 transitions, 846 flow. Second operand 14 states and 1616 transitions. [2021-12-21 15:03:37,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 236 transitions, 2142 flow [2021-12-21 15:03:38,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 236 transitions, 1776 flow, removed 144 selfloop flow, removed 33 redundant places. [2021-12-21 15:03:38,412 INFO L242 Difference]: Finished difference. Result has 193 places, 142 transitions, 670 flow [2021-12-21 15:03:38,413 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-21 15:03:38,413 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 51 predicate places. [2021-12-21 15:03:38,413 INFO L470 AbstractCegarLoop]: Abstraction has has 193 places, 142 transitions, 670 flow [2021-12-21 15:03:38,413 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-21 15:03:38,413 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:38,414 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-21 15:03:38,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-21 15:03:38,414 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-21 15:03:38,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:38,414 INFO L85 PathProgramCache]: Analyzing trace with hash 986246620, now seen corresponding path program 1 times [2021-12-21 15:03:38,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:38,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920203942] [2021-12-21 15:03:38,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:38,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:03:38,498 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-21 15:03:38,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:03:38,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920203942] [2021-12-21 15:03:38,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920203942] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:03:38,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:03:38,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:03:38,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665308905] [2021-12-21 15:03:38,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:03:38,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:03:38,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:03:38,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:03:38,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:03:38,501 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 135 [2021-12-21 15:03:38,501 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-21 15:03:38,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:03:38,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 135 [2021-12-21 15:03:38,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:03:39,383 INFO L129 PetriNetUnfolder]: 1680/7136 cut-off events. [2021-12-21 15:03:39,384 INFO L130 PetriNetUnfolder]: For 19792/22137 co-relation queries the response was YES. [2021-12-21 15:03:39,440 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-21 15:03:39,448 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 24 selfloop transitions, 1 changer transitions 35/173 dead transitions. [2021-12-21 15:03:39,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 173 transitions, 1026 flow [2021-12-21 15:03:39,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:03:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-21 15:03:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 814 transitions. [2021-12-21 15:03:39,449 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8613756613756614 [2021-12-21 15:03:39,449 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 814 transitions. [2021-12-21 15:03:39,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 814 transitions. [2021-12-21 15:03:39,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:03:39,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 814 transitions. [2021-12-21 15:03:39,451 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-21 15:03:39,455 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-21 15:03:39,456 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-21 15:03:39,456 INFO L186 Difference]: Start difference. First operand has 193 places, 142 transitions, 670 flow. Second operand 7 states and 814 transitions. [2021-12-21 15:03:39,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 173 transitions, 1026 flow [2021-12-21 15:03:39,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 173 transitions, 750 flow, removed 88 selfloop flow, removed 29 redundant places. [2021-12-21 15:03:39,785 INFO L242 Difference]: Finished difference. Result has 171 places, 136 transitions, 456 flow [2021-12-21 15:03:39,785 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-21 15:03:39,786 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 29 predicate places. [2021-12-21 15:03:39,786 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 136 transitions, 456 flow [2021-12-21 15:03:39,786 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-21 15:03:39,786 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:03:39,786 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-21 15:03:39,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-21 15:03:39,787 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-21 15:03:39,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:03:39,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1386893046, now seen corresponding path program 2 times [2021-12-21 15:03:39,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:03:39,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823649855] [2021-12-21 15:03:39,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:03:39,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:03:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 15:03:39,865 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 15:03:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 15:03:40,097 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 15:03:40,097 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 15:03:40,098 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-21 15:03:40,100 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-21 15:03:40,100 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-21 15:03:40,100 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-21 15:03:40,100 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-21 15:03:40,101 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-12-21 15:03:40,101 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-21 15:03:40,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-21 15:03:40,108 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:03:40,117 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-21 15:03:40,131 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 15:03:40,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:03:40 BasicIcfg [2021-12-21 15:03:40,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 15:03:40,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 15:03:40,352 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 15:03:40,352 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 15:03:40,353 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:03:08" (3/4) ... [2021-12-21 15:03:40,354 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-21 15:03:40,544 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 15:03:40,544 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 15:03:40,545 INFO L158 Benchmark]: Toolchain (without parser) took 34338.84ms. Allocated memory was 90.2MB in the beginning and 11.1GB in the end (delta: 11.0GB). Free memory was 54.8MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2021-12-21 15:03:40,545 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 90.2MB. Free memory was 46.8MB in the beginning and 46.8MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 15:03:40,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 850.15ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 54.6MB in the beginning and 69.6MB in the end (delta: -15.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-21 15:03:40,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.06ms. Allocated memory is still 109.1MB. Free memory was 69.6MB in the beginning and 66.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 15:03:40,546 INFO L158 Benchmark]: Boogie Preprocessor took 65.06ms. Allocated memory is still 109.1MB. Free memory was 66.7MB in the beginning and 64.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 15:03:40,546 INFO L158 Benchmark]: RCFGBuilder took 1442.73ms. Allocated memory is still 109.1MB. Free memory was 64.5MB in the beginning and 70.1MB in the end (delta: -5.6MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2021-12-21 15:03:40,547 INFO L158 Benchmark]: TraceAbstraction took 31675.66ms. Allocated memory was 109.1MB in the beginning and 11.1GB in the end (delta: 11.0GB). Free memory was 69.5MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2021-12-21 15:03:40,547 INFO L158 Benchmark]: Witness Printer took 192.33ms. Allocated memory is still 11.1GB. Free memory was 9.7GB in the beginning and 9.7GB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2021-12-21 15:03:40,548 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 90.2MB. Free memory was 46.8MB in the beginning and 46.8MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 850.15ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 54.6MB in the beginning and 69.6MB in the end (delta: -15.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.06ms. Allocated memory is still 109.1MB. Free memory was 69.6MB in the beginning and 66.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.06ms. Allocated memory is still 109.1MB. Free memory was 66.7MB in the beginning and 64.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1442.73ms. Allocated memory is still 109.1MB. Free memory was 64.5MB in the beginning and 70.1MB in the end (delta: -5.6MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * TraceAbstraction took 31675.66ms. Allocated memory was 109.1MB in the beginning and 11.1GB in the end (delta: 11.0GB). Free memory was 69.5MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 192.33ms. Allocated memory is still 11.1GB. Free memory was 9.7GB in the beginning and 9.7GB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. 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=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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: 31.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 28.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1034 SdHoareTripleChecker+Valid, 2.7s 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.5s 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.5s SatisfiabilityAnalysisTime, 1.8s 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-21 15:03:40,783 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-12-21 15:03:40,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 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