./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e19ca921 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/mix005_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 13:26:42,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 13:26:42,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 13:26:43,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 13:26:43,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 13:26:43,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 13:26:43,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 13:26:43,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 13:26:43,012 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 13:26:43,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 13:26:43,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 13:26:43,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 13:26:43,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 13:26:43,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 13:26:43,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 13:26:43,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 13:26:43,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 13:26:43,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 13:26:43,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 13:26:43,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 13:26:43,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 13:26:43,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 13:26:43,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 13:26:43,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 13:26:43,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 13:26:43,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 13:26:43,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 13:26:43,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 13:26:43,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 13:26:43,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 13:26:43,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 13:26:43,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 13:26:43,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 13:26:43,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 13:26:43,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 13:26:43,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 13:26:43,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 13:26:43,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 13:26:43,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 13:26:43,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 13:26:43,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 13:26:43,044 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 13:26:43,067 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 13:26:43,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 13:26:43,068 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 13:26:43,068 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 13:26:43,069 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 13:26:43,069 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 13:26:43,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 13:26:43,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 13:26:43,070 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 13:26:43,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 13:26:43,071 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 13:26:43,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 13:26:43,071 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 13:26:43,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 13:26:43,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 13:26:43,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 13:26:43,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 13:26:43,072 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 13:26:43,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 13:26:43,072 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 13:26:43,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 13:26:43,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 13:26:43,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 13:26:43,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 13:26:43,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:26:43,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 13:26:43,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 13:26:43,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 13:26:43,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 13:26:43,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 13:26:43,074 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 13:26:43,075 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 13:26:43,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 13:26:43,075 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 13:26:43,075 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 -> c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 [2021-12-22 13:26:43,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 13:26:43,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 13:26:43,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 13:26:43,272 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 13:26:43,273 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 13:26:43,274 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i [2021-12-22 13:26:43,328 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894c3b176/727afcd2488f457b92c83b0bbc532245/FLAG603fae53a [2021-12-22 13:26:43,704 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 13:26:43,705 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i [2021-12-22 13:26:43,719 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894c3b176/727afcd2488f457b92c83b0bbc532245/FLAG603fae53a [2021-12-22 13:26:43,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894c3b176/727afcd2488f457b92c83b0bbc532245 [2021-12-22 13:26:43,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 13:26:43,732 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 13:26:43,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 13:26:43,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 13:26:43,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 13:26:43,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:26:43" (1/1) ... [2021-12-22 13:26:43,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@498ffa83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:26:43, skipping insertion in model container [2021-12-22 13:26:43,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:26:43" (1/1) ... [2021-12-22 13:26:43,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 13:26:43,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 13:26:43,899 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/mix005_tso.oepc.i[949,962] [2021-12-22 13:26:44,036 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:26:44,046 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 13:26:44,058 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/mix005_tso.oepc.i[949,962] [2021-12-22 13:26:44,100 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:26:44,130 INFO L208 MainTranslator]: Completed translation [2021-12-22 13:26:44,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:26:44 WrapperNode [2021-12-22 13:26:44,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 13:26:44,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 13:26:44,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 13:26:44,132 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 13:26:44,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:26:44" (1/1) ... [2021-12-22 13:26:44,165 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:26:44" (1/1) ... [2021-12-22 13:26:44,202 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 293 [2021-12-22 13:26:44,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 13:26:44,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 13:26:44,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 13:26:44,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 13:26:44,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:26:44" (1/1) ... [2021-12-22 13:26:44,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:26:44" (1/1) ... [2021-12-22 13:26:44,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:26:44" (1/1) ... [2021-12-22 13:26:44,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:26:44" (1/1) ... [2021-12-22 13:26:44,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:26:44" (1/1) ... [2021-12-22 13:26:44,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:26:44" (1/1) ... [2021-12-22 13:26:44,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:26:44" (1/1) ... [2021-12-22 13:26:44,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 13:26:44,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 13:26:44,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 13:26:44,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 13:26:44,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:26:44" (1/1) ... [2021-12-22 13:26:44,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:26:44,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:26:44,315 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-22 13:26:44,419 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-22 13:26:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 13:26:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-22 13:26:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 13:26:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 13:26:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 13:26:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-22 13:26:44,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-22 13:26:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-22 13:26:44,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-22 13:26:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-22 13:26:44,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-22 13:26:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-12-22 13:26:44,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-12-22 13:26:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 13:26:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-22 13:26:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 13:26:44,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 13:26:44,444 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-22 13:26:44,574 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 13:26:44,575 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 13:26:44,936 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 13:26:45,267 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 13:26:45,268 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-22 13:26:45,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:26:45 BoogieIcfgContainer [2021-12-22 13:26:45,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 13:26:45,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 13:26:45,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 13:26:45,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 13:26:45,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 01:26:43" (1/3) ... [2021-12-22 13:26:45,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba60da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:26:45, skipping insertion in model container [2021-12-22 13:26:45,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:26:44" (2/3) ... [2021-12-22 13:26:45,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba60da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:26:45, skipping insertion in model container [2021-12-22 13:26:45,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:26:45" (3/3) ... [2021-12-22 13:26:45,276 INFO L111 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2021-12-22 13:26:45,282 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-22 13:26:45,282 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 13:26:45,282 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-22 13:26:45,283 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-22 13:26:45,330 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,330 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,330 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,331 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,331 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,331 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,332 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,332 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,332 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,332 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,333 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,333 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,333 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,333 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,333 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,334 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,334 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,334 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,335 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,335 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,335 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,336 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,336 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,337 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,337 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,337 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,337 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,337 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,338 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,338 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,338 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,338 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,338 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,339 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,339 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,339 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,339 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,339 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,340 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,340 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,340 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,340 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,341 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,341 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,341 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,341 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,341 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,341 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,342 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,342 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,342 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,342 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,342 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,343 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,343 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,343 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,344 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,344 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,344 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,344 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,345 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,345 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,345 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,345 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,345 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,346 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,346 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,346 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,346 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,347 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,347 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,347 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,347 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,347 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,347 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,348 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,348 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,349 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,350 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,351 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,351 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,351 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,352 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,353 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,353 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,353 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,353 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,357 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,357 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,357 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,357 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,357 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,358 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,358 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,358 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,358 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,358 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,358 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,359 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,359 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,359 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,359 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,360 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,360 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,360 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,360 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,360 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,360 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,361 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,361 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,361 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,361 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,363 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,364 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,364 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,364 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,364 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,364 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,364 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,365 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,365 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,365 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,366 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,366 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,366 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,366 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,366 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,366 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,366 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,367 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,367 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,368 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,368 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,369 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,369 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,369 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,369 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,369 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,370 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,370 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,370 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,370 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,370 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,370 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,371 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,371 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,372 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,372 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,372 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,372 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,372 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,373 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,373 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,373 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:26:45,374 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-22 13:26:45,417 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 13:26:45,430 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-22 13:26:45,430 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-22 13:26:45,442 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2021-12-22 13:26:45,498 INFO L129 PetriNetUnfolder]: 2/136 cut-off events. [2021-12-22 13:26:45,498 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-22 13:26:45,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2021-12-22 13:26:45,501 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 140 transitions, 300 flow [2021-12-22 13:26:45,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 136 transitions, 284 flow [2021-12-22 13:26:45,560 INFO L129 PetriNetUnfolder]: 0/66 cut-off events. [2021-12-22 13:26:45,560 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-22 13:26:45,561 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:26:45,562 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] [2021-12-22 13:26:45,562 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-22 13:26:45,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:26:45,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1996518298, now seen corresponding path program 1 times [2021-12-22 13:26:45,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:26:45,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314456193] [2021-12-22 13:26:45,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:26:45,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:26:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:26:45,830 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-22 13:26:45,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:26:45,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314456193] [2021-12-22 13:26:45,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314456193] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:26:45,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:26:45,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 13:26:45,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318075373] [2021-12-22 13:26:45,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:26:45,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 13:26:45,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:26:45,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 13:26:45,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 13:26:45,863 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 140 [2021-12-22 13:26:45,867 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 136 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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-22 13:26:45,867 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:26:45,868 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 140 [2021-12-22 13:26:45,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:26:46,095 INFO L129 PetriNetUnfolder]: 161/1036 cut-off events. [2021-12-22 13:26:46,095 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-12-22 13:26:46,101 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 1036 events. 161/1036 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 7039 event pairs, 103 based on Foata normal form. 35/1013 useless extension candidates. Maximal degree in co-relation 1279. Up to 187 conditions per place. [2021-12-22 13:26:46,106 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 17 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2021-12-22 13:26:46,106 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 139 transitions, 334 flow [2021-12-22 13:26:46,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 13:26:46,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-22 13:26:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2021-12-22 13:26:46,118 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9428571428571428 [2021-12-22 13:26:46,118 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2021-12-22 13:26:46,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2021-12-22 13:26:46,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:26:46,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2021-12-22 13:26:46,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 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-22 13:26:46,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 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-22 13:26:46,142 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 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-22 13:26:46,144 INFO L186 Difference]: Start difference. First operand has 147 places, 136 transitions, 284 flow. Second operand 3 states and 396 transitions. [2021-12-22 13:26:46,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 139 transitions, 334 flow [2021-12-22 13:26:46,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 139 transitions, 328 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-22 13:26:46,150 INFO L242 Difference]: Finished difference. Result has 143 places, 132 transitions, 276 flow [2021-12-22 13:26:46,151 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=143, PETRI_TRANSITIONS=132} [2021-12-22 13:26:46,154 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, -4 predicate places. [2021-12-22 13:26:46,154 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 132 transitions, 276 flow [2021-12-22 13:26:46,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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-22 13:26:46,154 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:26:46,155 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-22 13:26:46,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 13:26:46,155 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-22 13:26:46,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:26:46,156 INFO L85 PathProgramCache]: Analyzing trace with hash -583916909, now seen corresponding path program 1 times [2021-12-22 13:26:46,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:26:46,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374698667] [2021-12-22 13:26:46,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:26:46,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:26:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:26:46,355 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-22 13:26:46,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:26:46,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374698667] [2021-12-22 13:26:46,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374698667] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:26:46,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:26:46,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:26:46,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924439723] [2021-12-22 13:26:46,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:26:46,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:26:46,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:26:46,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:26:46,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:26:46,377 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 140 [2021-12-22 13:26:46,377 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 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-22 13:26:46,378 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:26:46,378 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 140 [2021-12-22 13:26:46,378 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:26:46,864 INFO L129 PetriNetUnfolder]: 869/2454 cut-off events. [2021-12-22 13:26:46,864 INFO L130 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2021-12-22 13:26:46,870 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3925 conditions, 2454 events. 869/2454 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 19578 event pairs, 129 based on Foata normal form. 0/2397 useless extension candidates. Maximal degree in co-relation 3867. Up to 609 conditions per place. [2021-12-22 13:26:46,876 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 21 selfloop transitions, 2 changer transitions 53/176 dead transitions. [2021-12-22 13:26:46,876 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 176 transitions, 504 flow [2021-12-22 13:26:46,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:26:46,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:26:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1118 transitions. [2021-12-22 13:26:46,881 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8873015873015873 [2021-12-22 13:26:46,881 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1118 transitions. [2021-12-22 13:26:46,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1118 transitions. [2021-12-22 13:26:46,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:26:46,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1118 transitions. [2021-12-22 13:26:46,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.22222222222223) internal successors, (1118), 9 states have internal predecessors, (1118), 0 states have call successors, (0), 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-22 13:26:46,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 0 states have call successors, (0), 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-22 13:26:46,888 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 0 states have call successors, (0), 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-22 13:26:46,888 INFO L186 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 9 states and 1118 transitions. [2021-12-22 13:26:46,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 176 transitions, 504 flow [2021-12-22 13:26:46,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 176 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-22 13:26:46,893 INFO L242 Difference]: Finished difference. Result has 156 places, 118 transitions, 264 flow [2021-12-22 13:26:46,893 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=264, PETRI_PLACES=156, PETRI_TRANSITIONS=118} [2021-12-22 13:26:46,893 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 9 predicate places. [2021-12-22 13:26:46,894 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 118 transitions, 264 flow [2021-12-22 13:26:46,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 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-22 13:26:46,894 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:26:46,894 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-22 13:26:46,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 13:26:46,895 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-22 13:26:46,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:26:46,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1362219406, now seen corresponding path program 1 times [2021-12-22 13:26:46,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:26:46,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926985297] [2021-12-22 13:26:46,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:26:46,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:26:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:26:47,088 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-22 13:26:47,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:26:47,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926985297] [2021-12-22 13:26:47,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926985297] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:26:47,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:26:47,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:26:47,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141988874] [2021-12-22 13:26:47,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:26:47,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:26:47,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:26:47,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:26:47,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:26:47,092 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 140 [2021-12-22 13:26:47,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 118 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 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-22 13:26:47,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:26:47,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 140 [2021-12-22 13:26:47,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:26:47,481 INFO L129 PetriNetUnfolder]: 746/1607 cut-off events. [2021-12-22 13:26:47,482 INFO L130 PetriNetUnfolder]: For 329/329 co-relation queries the response was YES. [2021-12-22 13:26:47,486 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3122 conditions, 1607 events. 746/1607 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10020 event pairs, 200 based on Foata normal form. 36/1589 useless extension candidates. Maximal degree in co-relation 3057. Up to 571 conditions per place. [2021-12-22 13:26:47,490 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 22 selfloop transitions, 2 changer transitions 37/161 dead transitions. [2021-12-22 13:26:47,490 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 161 transitions, 492 flow [2021-12-22 13:26:47,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:26:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:26:47,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1116 transitions. [2021-12-22 13:26:47,493 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8857142857142857 [2021-12-22 13:26:47,493 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1116 transitions. [2021-12-22 13:26:47,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1116 transitions. [2021-12-22 13:26:47,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:26:47,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1116 transitions. [2021-12-22 13:26:47,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.0) internal successors, (1116), 9 states have internal predecessors, (1116), 0 states have call successors, (0), 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-22 13:26:47,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 0 states have call successors, (0), 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-22 13:26:47,498 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 0 states have call successors, (0), 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-22 13:26:47,498 INFO L186 Difference]: Start difference. First operand has 156 places, 118 transitions, 264 flow. Second operand 9 states and 1116 transitions. [2021-12-22 13:26:47,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 161 transitions, 492 flow [2021-12-22 13:26:47,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 161 transitions, 460 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-12-22 13:26:47,509 INFO L242 Difference]: Finished difference. Result has 143 places, 118 transitions, 268 flow [2021-12-22 13:26:47,509 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=268, PETRI_PLACES=143, PETRI_TRANSITIONS=118} [2021-12-22 13:26:47,511 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, -4 predicate places. [2021-12-22 13:26:47,511 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 118 transitions, 268 flow [2021-12-22 13:26:47,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 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-22 13:26:47,512 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:26:47,512 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-22 13:26:47,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 13:26:47,512 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-22 13:26:47,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:26:47,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1294539535, now seen corresponding path program 1 times [2021-12-22 13:26:47,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:26:47,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230555885] [2021-12-22 13:26:47,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:26:47,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:26:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:26:47,680 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-22 13:26:47,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:26:47,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230555885] [2021-12-22 13:26:47,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230555885] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:26:47,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:26:47,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:26:47,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278484928] [2021-12-22 13:26:47,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:26:47,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:26:47,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:26:47,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:26:47,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:26:47,685 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2021-12-22 13:26:47,686 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 118 transitions, 268 flow. Second operand has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 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-22 13:26:47,686 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:26:47,686 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2021-12-22 13:26:47,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:26:48,134 INFO L129 PetriNetUnfolder]: 895/1824 cut-off events. [2021-12-22 13:26:48,135 INFO L130 PetriNetUnfolder]: For 478/478 co-relation queries the response was YES. [2021-12-22 13:26:48,139 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3661 conditions, 1824 events. 895/1824 cut-off events. For 478/478 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11068 event pairs, 219 based on Foata normal form. 39/1833 useless extension candidates. Maximal degree in co-relation 3593. Up to 802 conditions per place. [2021-12-22 13:26:48,145 INFO L132 encePairwiseOnDemand]: 127/140 looper letters, 25 selfloop transitions, 11 changer transitions 52/186 dead transitions. [2021-12-22 13:26:48,145 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 186 transitions, 622 flow [2021-12-22 13:26:48,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 13:26:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-22 13:26:48,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1701 transitions. [2021-12-22 13:26:48,149 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8678571428571429 [2021-12-22 13:26:48,149 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1701 transitions. [2021-12-22 13:26:48,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1701 transitions. [2021-12-22 13:26:48,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:26:48,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1701 transitions. [2021-12-22 13:26:48,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 121.5) internal successors, (1701), 14 states have internal predecessors, (1701), 0 states have call successors, (0), 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-22 13:26:48,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 140.0) internal successors, (2100), 15 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-22 13:26:48,156 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 140.0) internal successors, (2100), 15 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-22 13:26:48,156 INFO L186 Difference]: Start difference. First operand has 143 places, 118 transitions, 268 flow. Second operand 14 states and 1701 transitions. [2021-12-22 13:26:48,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 186 transitions, 622 flow [2021-12-22 13:26:48,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 186 transitions, 582 flow, removed 18 selfloop flow, removed 8 redundant places. [2021-12-22 13:26:48,164 INFO L242 Difference]: Finished difference. Result has 153 places, 126 transitions, 364 flow [2021-12-22 13:26:48,165 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=364, PETRI_PLACES=153, PETRI_TRANSITIONS=126} [2021-12-22 13:26:48,165 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 6 predicate places. [2021-12-22 13:26:48,165 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 126 transitions, 364 flow [2021-12-22 13:26:48,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 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-22 13:26:48,166 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:26:48,166 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] [2021-12-22 13:26:48,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 13:26:48,167 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-22 13:26:48,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:26:48,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1908593719, now seen corresponding path program 1 times [2021-12-22 13:26:48,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:26:48,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917623836] [2021-12-22 13:26:48,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:26:48,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:26:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:26:48,379 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-22 13:26:48,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:26:48,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917623836] [2021-12-22 13:26:48,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917623836] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:26:48,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:26:48,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 13:26:48,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493178614] [2021-12-22 13:26:48,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:26:48,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 13:26:48,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:26:48,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 13:26:48,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-22 13:26:48,382 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-12-22 13:26:48,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 126 transitions, 364 flow. Second operand has 10 states, 10 states have (on average 114.7) internal successors, (1147), 10 states have internal predecessors, (1147), 0 states have call successors, (0), 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-22 13:26:48,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:26:48,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-12-22 13:26:48,384 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:26:48,821 INFO L129 PetriNetUnfolder]: 764/1647 cut-off events. [2021-12-22 13:26:48,821 INFO L130 PetriNetUnfolder]: For 4612/4850 co-relation queries the response was YES. [2021-12-22 13:26:48,827 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5908 conditions, 1647 events. 764/1647 cut-off events. For 4612/4850 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9711 event pairs, 418 based on Foata normal form. 35/1632 useless extension candidates. Maximal degree in co-relation 5830. Up to 777 conditions per place. [2021-12-22 13:26:48,834 INFO L132 encePairwiseOnDemand]: 126/140 looper letters, 26 selfloop transitions, 15 changer transitions 35/172 dead transitions. [2021-12-22 13:26:48,834 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 172 transitions, 850 flow [2021-12-22 13:26:48,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 13:26:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-22 13:26:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1655 transitions. [2021-12-22 13:26:48,837 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8443877551020408 [2021-12-22 13:26:48,838 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1655 transitions. [2021-12-22 13:26:48,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1655 transitions. [2021-12-22 13:26:48,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:26:48,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1655 transitions. [2021-12-22 13:26:48,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 118.21428571428571) internal successors, (1655), 14 states have internal predecessors, (1655), 0 states have call successors, (0), 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-22 13:26:48,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 140.0) internal successors, (2100), 15 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-22 13:26:48,844 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 140.0) internal successors, (2100), 15 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-22 13:26:48,844 INFO L186 Difference]: Start difference. First operand has 153 places, 126 transitions, 364 flow. Second operand 14 states and 1655 transitions. [2021-12-22 13:26:48,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 172 transitions, 850 flow [2021-12-22 13:26:48,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 172 transitions, 834 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-12-22 13:26:48,851 INFO L242 Difference]: Finished difference. Result has 160 places, 129 transitions, 466 flow [2021-12-22 13:26:48,851 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=466, PETRI_PLACES=160, PETRI_TRANSITIONS=129} [2021-12-22 13:26:48,851 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 13 predicate places. [2021-12-22 13:26:48,852 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 129 transitions, 466 flow [2021-12-22 13:26:48,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 114.7) internal successors, (1147), 10 states have internal predecessors, (1147), 0 states have call successors, (0), 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-22 13:26:48,852 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:26:48,852 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-22 13:26:48,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 13:26:48,853 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-22 13:26:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:26:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash 593096651, now seen corresponding path program 1 times [2021-12-22 13:26:48,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:26:48,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074844941] [2021-12-22 13:26:48,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:26:48,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:26:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:26:48,971 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-22 13:26:48,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:26:48,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074844941] [2021-12-22 13:26:48,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074844941] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:26:48,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:26:48,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:26:48,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576838544] [2021-12-22 13:26:48,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:26:48,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:26:48,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:26:48,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:26:48,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:26:48,974 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2021-12-22 13:26:48,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 129 transitions, 466 flow. Second operand has 8 states, 8 states have (on average 116.875) internal successors, (935), 8 states have internal predecessors, (935), 0 states have call successors, (0), 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-22 13:26:48,975 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:26:48,975 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2021-12-22 13:26:48,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:26:49,392 INFO L129 PetriNetUnfolder]: 755/1640 cut-off events. [2021-12-22 13:26:49,392 INFO L130 PetriNetUnfolder]: For 13849/14242 co-relation queries the response was YES. [2021-12-22 13:26:49,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8136 conditions, 1640 events. 755/1640 cut-off events. For 13849/14242 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9845 event pairs, 78 based on Foata normal form. 39/1647 useless extension candidates. Maximal degree in co-relation 8051. Up to 638 conditions per place. [2021-12-22 13:26:49,408 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 41 selfloop transitions, 9 changer transitions 46/194 dead transitions. [2021-12-22 13:26:49,409 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 194 transitions, 1350 flow [2021-12-22 13:26:49,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 13:26:49,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-22 13:26:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1699 transitions. [2021-12-22 13:26:49,412 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8668367346938776 [2021-12-22 13:26:49,412 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1699 transitions. [2021-12-22 13:26:49,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1699 transitions. [2021-12-22 13:26:49,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:26:49,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1699 transitions. [2021-12-22 13:26:49,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 121.35714285714286) internal successors, (1699), 14 states have internal predecessors, (1699), 0 states have call successors, (0), 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-22 13:26:49,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 140.0) internal successors, (2100), 15 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-22 13:26:49,420 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 140.0) internal successors, (2100), 15 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-22 13:26:49,420 INFO L186 Difference]: Start difference. First operand has 160 places, 129 transitions, 466 flow. Second operand 14 states and 1699 transitions. [2021-12-22 13:26:49,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 194 transitions, 1350 flow [2021-12-22 13:26:49,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 194 transitions, 1287 flow, removed 21 selfloop flow, removed 9 redundant places. [2021-12-22 13:26:49,430 INFO L242 Difference]: Finished difference. Result has 168 places, 133 transitions, 536 flow [2021-12-22 13:26:49,430 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=536, PETRI_PLACES=168, PETRI_TRANSITIONS=133} [2021-12-22 13:26:49,432 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 21 predicate places. [2021-12-22 13:26:49,432 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 133 transitions, 536 flow [2021-12-22 13:26:49,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.875) internal successors, (935), 8 states have internal predecessors, (935), 0 states have call successors, (0), 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-22 13:26:49,433 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:26:49,433 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-22 13:26:49,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 13:26:49,433 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-22 13:26:49,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:26:49,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1893957237, now seen corresponding path program 1 times [2021-12-22 13:26:49,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:26:49,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914995222] [2021-12-22 13:26:49,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:26:49,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:26:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:26:49,624 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-22 13:26:49,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:26:49,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914995222] [2021-12-22 13:26:49,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914995222] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:26:49,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:26:49,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 13:26:49,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970749410] [2021-12-22 13:26:49,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:26:49,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 13:26:49,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:26:49,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 13:26:49,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-22 13:26:49,630 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 140 [2021-12-22 13:26:49,631 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 133 transitions, 536 flow. Second operand has 10 states, 10 states have (on average 115.7) internal successors, (1157), 10 states have internal predecessors, (1157), 0 states have call successors, (0), 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-22 13:26:49,631 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:26:49,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 140 [2021-12-22 13:26:49,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:26:50,111 INFO L129 PetriNetUnfolder]: 608/1450 cut-off events. [2021-12-22 13:26:50,111 INFO L130 PetriNetUnfolder]: For 20006/20214 co-relation queries the response was YES. [2021-12-22 13:26:50,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8609 conditions, 1450 events. 608/1450 cut-off events. For 20006/20214 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8531 event pairs, 174 based on Foata normal form. 26/1430 useless extension candidates. Maximal degree in co-relation 8519. Up to 603 conditions per place. [2021-12-22 13:26:50,130 INFO L132 encePairwiseOnDemand]: 131/140 looper letters, 41 selfloop transitions, 7 changer transitions 31/176 dead transitions. [2021-12-22 13:26:50,131 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 176 transitions, 1372 flow [2021-12-22 13:26:50,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 13:26:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-22 13:26:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1436 transitions. [2021-12-22 13:26:50,134 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8547619047619047 [2021-12-22 13:26:50,134 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1436 transitions. [2021-12-22 13:26:50,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1436 transitions. [2021-12-22 13:26:50,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:26:50,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1436 transitions. [2021-12-22 13:26:50,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 119.66666666666667) internal successors, (1436), 12 states have internal predecessors, (1436), 0 states have call successors, (0), 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-22 13:26:50,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 140.0) internal successors, (1820), 13 states have internal predecessors, (1820), 0 states have call successors, (0), 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-22 13:26:50,140 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 140.0) internal successors, (1820), 13 states have internal predecessors, (1820), 0 states have call successors, (0), 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-22 13:26:50,140 INFO L186 Difference]: Start difference. First operand has 168 places, 133 transitions, 536 flow. Second operand 12 states and 1436 transitions. [2021-12-22 13:26:50,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 176 transitions, 1372 flow [2021-12-22 13:26:50,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 176 transitions, 1145 flow, removed 109 selfloop flow, removed 11 redundant places. [2021-12-22 13:26:50,153 INFO L242 Difference]: Finished difference. Result has 166 places, 133 transitions, 487 flow [2021-12-22 13:26:50,154 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=487, PETRI_PLACES=166, PETRI_TRANSITIONS=133} [2021-12-22 13:26:50,154 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 19 predicate places. [2021-12-22 13:26:50,155 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 133 transitions, 487 flow [2021-12-22 13:26:50,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 115.7) internal successors, (1157), 10 states have internal predecessors, (1157), 0 states have call successors, (0), 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-22 13:26:50,156 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:26:50,156 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-22 13:26:50,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 13:26:50,156 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-22 13:26:50,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:26:50,157 INFO L85 PathProgramCache]: Analyzing trace with hash 930891738, now seen corresponding path program 1 times [2021-12-22 13:26:50,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:26:50,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259535411] [2021-12-22 13:26:50,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:26:50,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:26:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:26:50,241 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-22 13:26:50,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:26:50,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259535411] [2021-12-22 13:26:50,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259535411] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:26:50,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:26:50,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:26:50,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11243621] [2021-12-22 13:26:50,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:26:50,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:26:50,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:26:50,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:26:50,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:26:50,244 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 140 [2021-12-22 13:26:50,245 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 133 transitions, 487 flow. Second operand has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 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-22 13:26:50,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:26:50,245 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 140 [2021-12-22 13:26:50,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:26:50,821 INFO L129 PetriNetUnfolder]: 1480/3469 cut-off events. [2021-12-22 13:26:50,821 INFO L130 PetriNetUnfolder]: For 26052/26982 co-relation queries the response was YES. [2021-12-22 13:26:50,839 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15837 conditions, 3469 events. 1480/3469 cut-off events. For 26052/26982 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 26680 event pairs, 377 based on Foata normal form. 51/3344 useless extension candidates. Maximal degree in co-relation 15749. Up to 1100 conditions per place. [2021-12-22 13:26:50,863 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 63 selfloop transitions, 2 changer transitions 18/183 dead transitions. [2021-12-22 13:26:50,864 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 183 transitions, 1161 flow [2021-12-22 13:26:50,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 13:26:50,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-22 13:26:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2021-12-22 13:26:50,866 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8714285714285714 [2021-12-22 13:26:50,866 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2021-12-22 13:26:50,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2021-12-22 13:26:50,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:26:50,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2021-12-22 13:26:50,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 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-22 13:26:50,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:26:50,870 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:26:50,870 INFO L186 Difference]: Start difference. First operand has 166 places, 133 transitions, 487 flow. Second operand 7 states and 854 transitions. [2021-12-22 13:26:50,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 183 transitions, 1161 flow [2021-12-22 13:26:50,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 183 transitions, 1086 flow, removed 30 selfloop flow, removed 13 redundant places. [2021-12-22 13:26:50,945 INFO L242 Difference]: Finished difference. Result has 158 places, 134 transitions, 471 flow [2021-12-22 13:26:50,946 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=471, PETRI_PLACES=158, PETRI_TRANSITIONS=134} [2021-12-22 13:26:50,948 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 11 predicate places. [2021-12-22 13:26:50,948 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 134 transitions, 471 flow [2021-12-22 13:26:50,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 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-22 13:26:50,948 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:26:50,949 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-22 13:26:50,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 13:26:50,949 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-22 13:26:50,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:26:50,949 INFO L85 PathProgramCache]: Analyzing trace with hash 684361602, now seen corresponding path program 2 times [2021-12-22 13:26:50,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:26:50,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344192121] [2021-12-22 13:26:50,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:26:50,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:26:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:26:51,034 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-22 13:26:51,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:26:51,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344192121] [2021-12-22 13:26:51,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344192121] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:26:51,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:26:51,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:26:51,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891870845] [2021-12-22 13:26:51,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:26:51,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:26:51,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:26:51,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:26:51,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:26:51,037 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-12-22 13:26:51,037 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 134 transitions, 471 flow. Second operand has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 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-22 13:26:51,038 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:26:51,038 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-12-22 13:26:51,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:26:52,902 INFO L129 PetriNetUnfolder]: 7854/13647 cut-off events. [2021-12-22 13:26:52,903 INFO L130 PetriNetUnfolder]: For 113116/113650 co-relation queries the response was YES. [2021-12-22 13:26:52,972 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56610 conditions, 13647 events. 7854/13647 cut-off events. For 113116/113650 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 111117 event pairs, 353 based on Foata normal form. 185/13248 useless extension candidates. Maximal degree in co-relation 56530. Up to 4805 conditions per place. [2021-12-22 13:26:53,025 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 111 selfloop transitions, 18 changer transitions 37/265 dead transitions. [2021-12-22 13:26:53,025 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 265 transitions, 1743 flow [2021-12-22 13:26:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 13:26:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-22 13:26:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1230 transitions. [2021-12-22 13:26:53,028 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8785714285714286 [2021-12-22 13:26:53,028 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1230 transitions. [2021-12-22 13:26:53,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1230 transitions. [2021-12-22 13:26:53,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:26:53,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1230 transitions. [2021-12-22 13:26:53,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.0) internal successors, (1230), 10 states have internal predecessors, (1230), 0 states have call successors, (0), 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-22 13:26:53,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 140.0) internal successors, (1540), 11 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-22 13:26:53,033 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 140.0) internal successors, (1540), 11 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-22 13:26:53,033 INFO L186 Difference]: Start difference. First operand has 158 places, 134 transitions, 471 flow. Second operand 10 states and 1230 transitions. [2021-12-22 13:26:53,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 265 transitions, 1743 flow [2021-12-22 13:26:53,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 265 transitions, 1736 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-12-22 13:26:53,058 INFO L242 Difference]: Finished difference. Result has 166 places, 150 transitions, 596 flow [2021-12-22 13:26:53,059 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=596, PETRI_PLACES=166, PETRI_TRANSITIONS=150} [2021-12-22 13:26:53,059 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 19 predicate places. [2021-12-22 13:26:53,059 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 150 transitions, 596 flow [2021-12-22 13:26:53,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 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-22 13:26:53,060 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:26:53,060 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] [2021-12-22 13:26:53,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 13:26:53,060 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-22 13:26:53,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:26:53,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1705870879, now seen corresponding path program 1 times [2021-12-22 13:26:53,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:26:53,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832742647] [2021-12-22 13:26:53,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:26:53,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:26:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:26:53,305 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-22 13:26:53,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:26:53,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832742647] [2021-12-22 13:26:53,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832742647] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:26:53,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:26:53,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:26:53,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041551839] [2021-12-22 13:26:53,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:26:53,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:26:53,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:26:53,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:26:53,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:26:53,313 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-12-22 13:26:53,313 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 150 transitions, 596 flow. Second operand has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 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-22 13:26:53,313 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:26:53,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-12-22 13:26:53,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:26:55,213 INFO L129 PetriNetUnfolder]: 7101/13041 cut-off events. [2021-12-22 13:26:55,213 INFO L130 PetriNetUnfolder]: For 116639/117362 co-relation queries the response was YES. [2021-12-22 13:26:55,264 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62418 conditions, 13041 events. 7101/13041 cut-off events. For 116639/117362 co-relation queries the response was YES. Maximal size of possible extension queue 996. Compared 114276 event pairs, 211 based on Foata normal form. 410/13157 useless extension candidates. Maximal degree in co-relation 62333. Up to 3082 conditions per place. [2021-12-22 13:26:55,298 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 125 selfloop transitions, 34 changer transitions 47/305 dead transitions. [2021-12-22 13:26:55,298 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 305 transitions, 2376 flow [2021-12-22 13:26:55,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 13:26:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-22 13:26:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1601 transitions. [2021-12-22 13:26:55,302 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8796703296703297 [2021-12-22 13:26:55,302 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1601 transitions. [2021-12-22 13:26:55,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1601 transitions. [2021-12-22 13:26:55,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:26:55,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1601 transitions. [2021-12-22 13:26:55,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 123.15384615384616) internal successors, (1601), 13 states have internal predecessors, (1601), 0 states have call successors, (0), 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-22 13:26:55,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 0 states have call successors, (0), 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-22 13:26:55,308 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 0 states have call successors, (0), 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-22 13:26:55,308 INFO L186 Difference]: Start difference. First operand has 166 places, 150 transitions, 596 flow. Second operand 13 states and 1601 transitions. [2021-12-22 13:26:55,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 305 transitions, 2376 flow [2021-12-22 13:26:55,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 305 transitions, 2374 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-22 13:26:55,408 INFO L242 Difference]: Finished difference. Result has 183 places, 165 transitions, 840 flow [2021-12-22 13:26:55,409 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=840, PETRI_PLACES=183, PETRI_TRANSITIONS=165} [2021-12-22 13:26:55,409 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 36 predicate places. [2021-12-22 13:26:55,409 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 165 transitions, 840 flow [2021-12-22 13:26:55,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 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-22 13:26:55,410 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:26:55,410 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] [2021-12-22 13:26:55,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 13:26:55,411 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-22 13:26:55,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:26:55,411 INFO L85 PathProgramCache]: Analyzing trace with hash 116466977, now seen corresponding path program 1 times [2021-12-22 13:26:55,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:26:55,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451889577] [2021-12-22 13:26:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:26:55,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:26:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:26:55,545 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-22 13:26:55,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:26:55,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451889577] [2021-12-22 13:26:55,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451889577] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:26:55,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:26:55,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:26:55,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284162569] [2021-12-22 13:26:55,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:26:55,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:26:55,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:26:55,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:26:55,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:26:55,548 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-12-22 13:26:55,549 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 165 transitions, 840 flow. Second operand has 8 states, 8 states have (on average 115.25) internal successors, (922), 8 states have internal predecessors, (922), 0 states have call successors, (0), 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-22 13:26:55,549 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:26:55,549 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-12-22 13:26:55,549 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:26:57,473 INFO L129 PetriNetUnfolder]: 6475/12407 cut-off events. [2021-12-22 13:26:57,474 INFO L130 PetriNetUnfolder]: For 128644/129408 co-relation queries the response was YES. [2021-12-22 13:26:57,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66543 conditions, 12407 events. 6475/12407 cut-off events. For 128644/129408 co-relation queries the response was YES. Maximal size of possible extension queue 982. Compared 113047 event pairs, 274 based on Foata normal form. 325/12424 useless extension candidates. Maximal degree in co-relation 66450. Up to 2780 conditions per place. [2021-12-22 13:26:57,561 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 120 selfloop transitions, 52 changer transitions 64/334 dead transitions. [2021-12-22 13:26:57,561 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 334 transitions, 3058 flow [2021-12-22 13:26:57,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 13:26:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-22 13:26:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1971 transitions. [2021-12-22 13:26:57,564 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8799107142857143 [2021-12-22 13:26:57,564 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1971 transitions. [2021-12-22 13:26:57,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1971 transitions. [2021-12-22 13:26:57,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:26:57,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1971 transitions. [2021-12-22 13:26:57,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 123.1875) internal successors, (1971), 16 states have internal predecessors, (1971), 0 states have call successors, (0), 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-22 13:26:57,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 140.0) internal successors, (2380), 17 states have internal predecessors, (2380), 0 states have call successors, (0), 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-22 13:26:57,570 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 140.0) internal successors, (2380), 17 states have internal predecessors, (2380), 0 states have call successors, (0), 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-22 13:26:57,570 INFO L186 Difference]: Start difference. First operand has 183 places, 165 transitions, 840 flow. Second operand 16 states and 1971 transitions. [2021-12-22 13:26:57,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 334 transitions, 3058 flow [2021-12-22 13:26:58,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 334 transitions, 2899 flow, removed 49 selfloop flow, removed 6 redundant places. [2021-12-22 13:26:58,156 INFO L242 Difference]: Finished difference. Result has 198 places, 186 transitions, 1161 flow [2021-12-22 13:26:58,156 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1161, PETRI_PLACES=198, PETRI_TRANSITIONS=186} [2021-12-22 13:26:58,157 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 51 predicate places. [2021-12-22 13:26:58,157 INFO L470 AbstractCegarLoop]: Abstraction has has 198 places, 186 transitions, 1161 flow [2021-12-22 13:26:58,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.25) internal successors, (922), 8 states have internal predecessors, (922), 0 states have call successors, (0), 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-22 13:26:58,158 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:26:58,158 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-22 13:26:58,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 13:26:58,158 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-22 13:26:58,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:26:58,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1368630499, now seen corresponding path program 1 times [2021-12-22 13:26:58,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:26:58,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764329849] [2021-12-22 13:26:58,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:26:58,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:26:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:26:58,318 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-22 13:26:58,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:26:58,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764329849] [2021-12-22 13:26:58,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764329849] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:26:58,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:26:58,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:26:58,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417448046] [2021-12-22 13:26:58,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:26:58,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:26:58,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:26:58,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:26:58,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:26:58,321 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 140 [2021-12-22 13:26:58,322 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 186 transitions, 1161 flow. Second operand has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 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-22 13:26:58,322 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:26:58,322 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 140 [2021-12-22 13:26:58,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:26:59,975 INFO L129 PetriNetUnfolder]: 2778/9393 cut-off events. [2021-12-22 13:26:59,975 INFO L130 PetriNetUnfolder]: For 54650/60892 co-relation queries the response was YES. [2021-12-22 13:27:00,043 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38122 conditions, 9393 events. 2778/9393 cut-off events. For 54650/60892 co-relation queries the response was YES. Maximal size of possible extension queue 1291. Compared 119605 event pairs, 97 based on Foata normal form. 40/8732 useless extension candidates. Maximal degree in co-relation 38023. Up to 1976 conditions per place. [2021-12-22 13:27:00,129 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 58 selfloop transitions, 2 changer transitions 16/233 dead transitions. [2021-12-22 13:27:00,143 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 233 transitions, 1757 flow [2021-12-22 13:27:00,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 13:27:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-22 13:27:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 853 transitions. [2021-12-22 13:27:00,145 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8704081632653061 [2021-12-22 13:27:00,145 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 853 transitions. [2021-12-22 13:27:00,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 853 transitions. [2021-12-22 13:27:00,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:27:00,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 853 transitions. [2021-12-22 13:27:00,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 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-22 13:27:00,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:27:00,150 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:27:00,150 INFO L186 Difference]: Start difference. First operand has 198 places, 186 transitions, 1161 flow. Second operand 7 states and 853 transitions. [2021-12-22 13:27:00,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 233 transitions, 1757 flow [2021-12-22 13:27:01,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 233 transitions, 1588 flow, removed 62 selfloop flow, removed 7 redundant places. [2021-12-22 13:27:01,461 INFO L242 Difference]: Finished difference. Result has 202 places, 187 transitions, 1011 flow [2021-12-22 13:27:01,461 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1011, PETRI_PLACES=202, PETRI_TRANSITIONS=187} [2021-12-22 13:27:01,462 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 55 predicate places. [2021-12-22 13:27:01,462 INFO L470 AbstractCegarLoop]: Abstraction has has 202 places, 187 transitions, 1011 flow [2021-12-22 13:27:01,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 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-22 13:27:01,462 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:27:01,462 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-22 13:27:01,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-22 13:27:01,463 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-22 13:27:01,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:27:01,463 INFO L85 PathProgramCache]: Analyzing trace with hash 133294549, now seen corresponding path program 2 times [2021-12-22 13:27:01,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:27:01,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554371485] [2021-12-22 13:27:01,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:27:01,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:27:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:27:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:27:01,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:27:01,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554371485] [2021-12-22 13:27:01,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554371485] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:27:01,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:27:01,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:27:01,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112751634] [2021-12-22 13:27:01,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:27:01,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:27:01,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:27:01,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:27:01,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:27:01,560 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2021-12-22 13:27:01,560 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 187 transitions, 1011 flow. Second operand has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 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-22 13:27:01,560 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:27:01,561 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2021-12-22 13:27:01,561 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:27:05,170 INFO L129 PetriNetUnfolder]: 12000/23094 cut-off events. [2021-12-22 13:27:05,170 INFO L130 PetriNetUnfolder]: For 215433/220381 co-relation queries the response was YES. [2021-12-22 13:27:05,350 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114669 conditions, 23094 events. 12000/23094 cut-off events. For 215433/220381 co-relation queries the response was YES. Maximal size of possible extension queue 1940. Compared 236157 event pairs, 299 based on Foata normal form. 541/22869 useless extension candidates. Maximal degree in co-relation 114623. Up to 5268 conditions per place. [2021-12-22 13:27:05,373 INFO L132 encePairwiseOnDemand]: 129/140 looper letters, 65 selfloop transitions, 43 changer transitions 128/335 dead transitions. [2021-12-22 13:27:05,374 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 335 transitions, 2857 flow [2021-12-22 13:27:05,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-22 13:27:05,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-12-22 13:27:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2295 transitions. [2021-12-22 13:27:05,376 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8627819548872181 [2021-12-22 13:27:05,376 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2295 transitions. [2021-12-22 13:27:05,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2295 transitions. [2021-12-22 13:27:05,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:27:05,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2295 transitions. [2021-12-22 13:27:05,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 120.78947368421052) internal successors, (2295), 19 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-22 13:27:05,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 140.0) internal successors, (2800), 20 states have internal predecessors, (2800), 0 states have call successors, (0), 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-22 13:27:05,382 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 140.0) internal successors, (2800), 20 states have internal predecessors, (2800), 0 states have call successors, (0), 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-22 13:27:05,382 INFO L186 Difference]: Start difference. First operand has 202 places, 187 transitions, 1011 flow. Second operand 19 states and 2295 transitions. [2021-12-22 13:27:05,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 335 transitions, 2857 flow [2021-12-22 13:27:07,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 335 transitions, 2798 flow, removed 16 selfloop flow, removed 7 redundant places. [2021-12-22 13:27:07,141 INFO L242 Difference]: Finished difference. Result has 217 places, 170 transitions, 945 flow [2021-12-22 13:27:07,141 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=945, PETRI_PLACES=217, PETRI_TRANSITIONS=170} [2021-12-22 13:27:07,142 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 70 predicate places. [2021-12-22 13:27:07,142 INFO L470 AbstractCegarLoop]: Abstraction has has 217 places, 170 transitions, 945 flow [2021-12-22 13:27:07,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 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-22 13:27:07,143 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:27:07,143 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, 1, 1, 1, 1, 1] [2021-12-22 13:27:07,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 13:27:07,143 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-22 13:27:07,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:27:07,144 INFO L85 PathProgramCache]: Analyzing trace with hash 344268078, now seen corresponding path program 1 times [2021-12-22 13:27:07,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:27:07,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887001558] [2021-12-22 13:27:07,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:27:07,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:27:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:27:07,238 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-22 13:27:07,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:27:07,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887001558] [2021-12-22 13:27:07,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887001558] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:27:07,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:27:07,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:27:07,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081884169] [2021-12-22 13:27:07,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:27:07,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:27:07,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:27:07,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:27:07,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:27:07,241 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2021-12-22 13:27:07,242 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 170 transitions, 945 flow. Second operand has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 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-22 13:27:07,242 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:27:07,242 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2021-12-22 13:27:07,242 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:27:08,837 INFO L129 PetriNetUnfolder]: 2971/11282 cut-off events. [2021-12-22 13:27:08,837 INFO L130 PetriNetUnfolder]: For 45155/48589 co-relation queries the response was YES. [2021-12-22 13:27:08,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42160 conditions, 11282 events. 2971/11282 cut-off events. For 45155/48589 co-relation queries the response was YES. Maximal size of possible extension queue 1409. Compared 153822 event pairs, 113 based on Foata normal form. 16/10509 useless extension candidates. Maximal degree in co-relation 42054. Up to 1415 conditions per place. [2021-12-22 13:27:08,922 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 28 selfloop transitions, 1 changer transitions 26/197 dead transitions. [2021-12-22 13:27:08,922 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 197 transitions, 1257 flow [2021-12-22 13:27:08,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 13:27:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-22 13:27:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 844 transitions. [2021-12-22 13:27:08,924 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8612244897959184 [2021-12-22 13:27:08,924 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 844 transitions. [2021-12-22 13:27:08,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 844 transitions. [2021-12-22 13:27:08,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:27:08,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 844 transitions. [2021-12-22 13:27:08,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.57142857142857) internal successors, (844), 7 states have internal predecessors, (844), 0 states have call successors, (0), 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-22 13:27:08,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:27:08,926 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:27:08,926 INFO L186 Difference]: Start difference. First operand has 217 places, 170 transitions, 945 flow. Second operand 7 states and 844 transitions. [2021-12-22 13:27:08,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 197 transitions, 1257 flow [2021-12-22 13:27:09,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 197 transitions, 972 flow, removed 89 selfloop flow, removed 27 redundant places. [2021-12-22 13:27:09,829 INFO L242 Difference]: Finished difference. Result has 192 places, 165 transitions, 711 flow [2021-12-22 13:27:09,829 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=711, PETRI_PLACES=192, PETRI_TRANSITIONS=165} [2021-12-22 13:27:09,829 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 45 predicate places. [2021-12-22 13:27:09,829 INFO L470 AbstractCegarLoop]: Abstraction has has 192 places, 165 transitions, 711 flow [2021-12-22 13:27:09,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 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-22 13:27:09,830 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:27:09,830 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, 1, 1, 1, 1, 1] [2021-12-22 13:27:09,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 13:27:09,830 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-22 13:27:09,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:27:09,831 INFO L85 PathProgramCache]: Analyzing trace with hash 353597626, now seen corresponding path program 2 times [2021-12-22 13:27:09,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:27:09,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821477181] [2021-12-22 13:27:09,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:27:09,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:27:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:27:10,121 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-22 13:27:10,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:27:10,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821477181] [2021-12-22 13:27:10,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821477181] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:27:10,122 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:27:10,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-22 13:27:10,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903716417] [2021-12-22 13:27:10,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:27:10,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-22 13:27:10,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:27:10,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-22 13:27:10,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-12-22 13:27:10,124 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 140 [2021-12-22 13:27:10,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 165 transitions, 711 flow. Second operand has 16 states, 16 states have (on average 110.625) internal successors, (1770), 16 states have internal predecessors, (1770), 0 states have call successors, (0), 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-22 13:27:10,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:27:10,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 140 [2021-12-22 13:27:10,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:27:10,908 INFO L129 PetriNetUnfolder]: 1367/5771 cut-off events. [2021-12-22 13:27:10,908 INFO L130 PetriNetUnfolder]: For 7069/7379 co-relation queries the response was YES. [2021-12-22 13:27:10,948 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15256 conditions, 5771 events. 1367/5771 cut-off events. For 7069/7379 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 69818 event pairs, 29 based on Foata normal form. 14/5465 useless extension candidates. Maximal degree in co-relation 15223. Up to 604 conditions per place. [2021-12-22 13:27:10,956 INFO L132 encePairwiseOnDemand]: 127/140 looper letters, 32 selfloop transitions, 10 changer transitions 9/185 dead transitions. [2021-12-22 13:27:10,956 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 185 transitions, 917 flow [2021-12-22 13:27:10,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 13:27:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-22 13:27:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1355 transitions. [2021-12-22 13:27:10,958 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8065476190476191 [2021-12-22 13:27:10,958 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1355 transitions. [2021-12-22 13:27:10,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1355 transitions. [2021-12-22 13:27:10,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:27:10,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1355 transitions. [2021-12-22 13:27:10,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 112.91666666666667) internal successors, (1355), 12 states have internal predecessors, (1355), 0 states have call successors, (0), 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-22 13:27:10,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 140.0) internal successors, (1820), 13 states have internal predecessors, (1820), 0 states have call successors, (0), 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-22 13:27:10,962 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 140.0) internal successors, (1820), 13 states have internal predecessors, (1820), 0 states have call successors, (0), 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-22 13:27:10,962 INFO L186 Difference]: Start difference. First operand has 192 places, 165 transitions, 711 flow. Second operand 12 states and 1355 transitions. [2021-12-22 13:27:10,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 185 transitions, 917 flow [2021-12-22 13:27:11,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 185 transitions, 894 flow, removed 9 selfloop flow, removed 8 redundant places. [2021-12-22 13:27:11,142 INFO L242 Difference]: Finished difference. Result has 193 places, 167 transitions, 754 flow [2021-12-22 13:27:11,142 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=754, PETRI_PLACES=193, PETRI_TRANSITIONS=167} [2021-12-22 13:27:11,143 INFO L334 CegarLoopForPetriNet]: 147 programPoint places, 46 predicate places. [2021-12-22 13:27:11,143 INFO L470 AbstractCegarLoop]: Abstraction has has 193 places, 167 transitions, 754 flow [2021-12-22 13:27:11,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 110.625) internal successors, (1770), 16 states have internal predecessors, (1770), 0 states have call successors, (0), 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-22 13:27:11,144 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:27:11,144 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, 1, 1, 1, 1, 1] [2021-12-22 13:27:11,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 13:27:11,144 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-22 13:27:11,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:27:11,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1948249120, now seen corresponding path program 3 times [2021-12-22 13:27:11,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:27:11,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617608732] [2021-12-22 13:27:11,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:27:11,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:27:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:27:11,183 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 13:27:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:27:11,275 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 13:27:11,277 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 13:27:11,278 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-22 13:27:11,279 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-22 13:27:11,280 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-22 13:27:11,281 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-22 13:27:11,281 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-22 13:27:11,281 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-12-22 13:27:11,281 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-22 13:27:11,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-22 13:27:11,285 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:27:11,289 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-22 13:27:11,289 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 13:27:11,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 01:27:11 BasicIcfg [2021-12-22 13:27:11,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 13:27:11,453 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 13:27:11,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 13:27:11,454 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 13:27:11,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:26:45" (3/4) ... [2021-12-22 13:27:11,459 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-22 13:27:11,592 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 13:27:11,593 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 13:27:11,593 INFO L158 Benchmark]: Toolchain (without parser) took 27861.06ms. Allocated memory was 94.4MB in the beginning and 9.4GB in the end (delta: 9.3GB). Free memory was 51.7MB in the beginning and 7.9GB in the end (delta: -7.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2021-12-22 13:27:11,594 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 94.4MB. Free memory was 70.0MB in the beginning and 69.9MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 13:27:11,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.65ms. Allocated memory is still 94.4MB. Free memory was 51.5MB in the beginning and 53.5MB in the end (delta: -2.0MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2021-12-22 13:27:11,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.63ms. Allocated memory is still 94.4MB. Free memory was 53.5MB in the beginning and 50.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-22 13:27:11,594 INFO L158 Benchmark]: Boogie Preprocessor took 59.17ms. Allocated memory is still 94.4MB. Free memory was 50.4MB in the beginning and 48.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 13:27:11,595 INFO L158 Benchmark]: RCFGBuilder took 1003.30ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 48.1MB in the beginning and 87.7MB in the end (delta: -39.6MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2021-12-22 13:27:11,595 INFO L158 Benchmark]: TraceAbstraction took 26180.38ms. Allocated memory was 136.3MB in the beginning and 9.4GB in the end (delta: 9.3GB). Free memory was 86.9MB in the beginning and 8.0GB in the end (delta: -7.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2021-12-22 13:27:11,595 INFO L158 Benchmark]: Witness Printer took 139.83ms. Allocated memory is still 9.4GB. Free memory was 8.0GB in the beginning and 7.9GB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2021-12-22 13:27:11,597 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 94.4MB. Free memory was 70.0MB in the beginning and 69.9MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.65ms. Allocated memory is still 94.4MB. Free memory was 51.5MB in the beginning and 53.5MB in the end (delta: -2.0MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.63ms. Allocated memory is still 94.4MB. Free memory was 53.5MB in the beginning and 50.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.17ms. Allocated memory is still 94.4MB. Free memory was 50.4MB in the beginning and 48.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1003.30ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 48.1MB in the beginning and 87.7MB in the end (delta: -39.6MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * TraceAbstraction took 26180.38ms. Allocated memory was 136.3MB in the beginning and 9.4GB in the end (delta: 9.3GB). Free memory was 86.9MB in the beginning and 8.0GB in the end (delta: -7.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 139.83ms. Allocated memory is still 9.4GB. Free memory was 8.0GB in the beginning and 7.9GB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L727] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L728] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L729] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L730] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L731] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L732] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L733] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L734] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0] [L735] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L736] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L737] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L738] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L739] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L740] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L741] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L742] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L743] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L744] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L746] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L748] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t145; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t145={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t145, ((void *)0), P0, ((void *)0))=-3, t145={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t146; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={5:0}, t146={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t146, ((void *)0), P1, ((void *)0))=-2, t145={5:0}, t146={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t147; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={5:0}, t146={6:0}, t147={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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(&t147, ((void *)0), P2, ((void *)0))=-1, t145={5:0}, t146={6:0}, t147={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t148; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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(&t148, ((void *)0), P3, ((void *)0))=0, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - 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: 863]: 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: 859]: 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: 865]: 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: 861]: 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, 178 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 22.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 983 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 983 mSDsluCounter, 616 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1452 mSDsCounter, 300 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2446 IncrementalHoareTripleChecker+Invalid, 2746 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 300 mSolverCounterUnsat, 117 mSDtfsCounter, 2446 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1161occurred in iteration=11, InterpolantAutomatonStates: 166, 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.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1544 NumberOfCodeBlocks, 1544 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1420 ConstructedInterpolants, 0 QuantifiedInterpolants, 6438 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-22 13:27:11,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE