./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix003.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix003.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 929f303f9fec34ceeaa6ac57212036dd2a2b082a21c34f6b9e4e20069df7c744 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 15:01:01,757 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 15:01:01,760 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 15:01:01,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 15:01:01,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 15:01:01,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 15:01:01,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 15:01:01,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 15:01:01,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 15:01:01,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 15:01:01,816 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 15:01:01,817 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 15:01:01,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 15:01:01,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 15:01:01,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 15:01:01,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 15:01:01,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 15:01:01,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 15:01:01,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 15:01:01,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 15:01:01,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 15:01:01,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 15:01:01,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 15:01:01,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 15:01:01,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 15:01:01,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 15:01:01,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 15:01:01,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 15:01:01,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 15:01:01,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 15:01:01,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 15:01:01,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 15:01:01,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 15:01:01,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 15:01:01,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 15:01:01,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 15:01:01,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 15:01:01,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 15:01:01,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 15:01:01,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 15:01:01,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 15:01:01,848 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 15:01:01,874 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 15:01:01,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 15:01:01,874 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 15:01:01,875 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 15:01:01,875 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 15:01:01,875 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 15:01:01,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 15:01:01,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 15:01:01,876 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 15:01:01,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 15:01:01,876 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 15:01:01,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 15:01:01,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 15:01:01,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 15:01:01,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 15:01:01,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 15:01:01,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 15:01:01,876 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 15:01:01,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 15:01:01,877 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 15:01:01,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 15:01:01,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 15:01:01,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 15:01:01,877 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 15:01:01,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:01:01,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 15:01:01,877 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 15:01:01,877 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 15:01:01,877 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 15:01:01,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 15:01:01,878 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 15:01:01,878 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 15:01:01,878 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 15:01:01,878 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 15:01:01,878 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 -> 929f303f9fec34ceeaa6ac57212036dd2a2b082a21c34f6b9e4e20069df7c744 [2021-12-21 15:01:02,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 15:01:02,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 15:01:02,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 15:01:02,099 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 15:01:02,103 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 15:01:02,104 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix003.oepc.i [2021-12-21 15:01:02,150 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29efa642e/0dfa949d7be64231871bda48b5e1713e/FLAG6109fc576 [2021-12-21 15:01:02,587 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 15:01:02,587 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix003.oepc.i [2021-12-21 15:01:02,599 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29efa642e/0dfa949d7be64231871bda48b5e1713e/FLAG6109fc576 [2021-12-21 15:01:02,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29efa642e/0dfa949d7be64231871bda48b5e1713e [2021-12-21 15:01:02,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 15:01:02,611 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 15:01:02,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 15:01:02,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 15:01:02,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 15:01:02,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:01:02" (1/1) ... [2021-12-21 15:01:02,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65af50f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:02, skipping insertion in model container [2021-12-21 15:01:02,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:01:02" (1/1) ... [2021-12-21 15:01:02,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 15:01:02,646 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 15:01:02,759 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/mix003.oepc.i[945,958] [2021-12-21 15:01:02,918 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:01:02,925 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 15:01:02,940 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/mix003.oepc.i[945,958] [2021-12-21 15:01:02,983 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:01:03,016 INFO L208 MainTranslator]: Completed translation [2021-12-21 15:01:03,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:03 WrapperNode [2021-12-21 15:01:03,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 15:01:03,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 15:01:03,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 15:01:03,018 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 15:01:03,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:03" (1/1) ... [2021-12-21 15:01:03,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:03" (1/1) ... [2021-12-21 15:01:03,072 INFO L137 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 179 [2021-12-21 15:01:03,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 15:01:03,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 15:01:03,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 15:01:03,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 15:01:03,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:03" (1/1) ... [2021-12-21 15:01:03,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:03" (1/1) ... [2021-12-21 15:01:03,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:03" (1/1) ... [2021-12-21 15:01:03,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:03" (1/1) ... [2021-12-21 15:01:03,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:03" (1/1) ... [2021-12-21 15:01:03,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:03" (1/1) ... [2021-12-21 15:01:03,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:03" (1/1) ... [2021-12-21 15:01:03,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 15:01:03,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 15:01:03,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 15:01:03,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 15:01:03,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:03" (1/1) ... [2021-12-21 15:01:03,138 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:01:03,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:01:03,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 15:01:03,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 15:01:03,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 15:01:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-21 15:01:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 15:01:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 15:01:03,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 15:01:03,197 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-21 15:01:03,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-21 15:01:03,197 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-21 15:01:03,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-21 15:01:03,197 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-21 15:01:03,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-21 15:01:03,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 15:01:03,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-21 15:01:03,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 15:01:03,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 15:01:03,199 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-21 15:01:03,351 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 15:01:03,352 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 15:01:03,689 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 15:01:03,961 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 15:01:03,961 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 15:01:03,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:01:03 BoogieIcfgContainer [2021-12-21 15:01:03,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 15:01:03,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 15:01:03,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 15:01:03,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 15:01:03,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:01:02" (1/3) ... [2021-12-21 15:01:03,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f9ec2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:01:03, skipping insertion in model container [2021-12-21 15:01:03,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:01:03" (2/3) ... [2021-12-21 15:01:03,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f9ec2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:01:03, skipping insertion in model container [2021-12-21 15:01:03,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:01:03" (3/3) ... [2021-12-21 15:01:03,969 INFO L111 eAbstractionObserver]: Analyzing ICFG mix003.oepc.i [2021-12-21 15:01:03,973 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-21 15:01:03,973 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 15:01:03,973 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-21 15:01:03,973 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-21 15:01:04,006 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,007 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,007 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,007 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,007 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,007 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,008 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,008 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,008 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,008 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,009 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,009 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,009 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,009 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,010 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,010 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,010 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,010 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,011 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,011 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,011 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,012 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,012 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,012 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,012 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,013 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,013 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,013 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,013 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,013 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,014 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,014 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,014 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,014 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,014 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,014 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,015 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,015 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,015 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,015 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,015 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,015 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,015 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,016 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,017 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,017 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,017 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,017 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,017 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,017 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,018 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,018 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,018 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,018 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,018 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,019 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,019 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,019 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,019 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,020 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,020 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,020 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,020 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,020 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,020 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,021 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,021 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,021 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,021 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,021 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,021 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,021 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,021 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,022 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,022 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,024 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,024 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,024 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,025 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,025 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,025 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,026 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,026 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,026 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,029 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,030 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,030 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,030 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,030 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,030 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,030 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,030 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,030 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,031 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,031 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,031 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,031 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,031 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,032 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,032 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,032 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,044 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,044 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,044 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,044 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,044 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,044 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,044 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,044 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,044 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,045 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,045 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,045 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,045 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,045 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,045 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,045 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,045 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,046 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,046 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,046 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,046 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,046 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,046 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,046 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,046 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,046 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,048 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,048 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,049 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,049 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,049 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,049 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,049 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,050 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,050 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,051 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,051 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,051 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,051 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,051 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,052 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,052 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,052 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,052 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,056 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,057 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,057 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,057 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,057 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,057 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,057 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,058 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,058 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,058 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,058 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,058 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,058 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,058 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,059 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,059 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,059 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,059 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,059 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,059 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,060 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,060 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,060 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,060 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,061 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,061 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,061 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,061 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,061 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,061 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,061 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,062 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,065 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,065 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,065 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,065 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,065 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,065 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,065 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,066 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,066 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,067 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:01:04,067 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-21 15:01:04,109 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 15:01:04,116 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 15:01:04,116 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-21 15:01:04,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2021-12-21 15:01:04,173 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2021-12-21 15:01:04,173 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-21 15:01:04,176 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-12-21 15:01:04,177 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2021-12-21 15:01:04,183 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2021-12-21 15:01:04,194 INFO L129 PetriNetUnfolder]: 0/50 cut-off events. [2021-12-21 15:01:04,194 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-21 15:01:04,195 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:04,195 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] [2021-12-21 15:01:04,196 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:04,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:04,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1818972421, now seen corresponding path program 1 times [2021-12-21 15:01:04,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:04,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140346762] [2021-12-21 15:01:04,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:04,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:04,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:04,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140346762] [2021-12-21 15:01:04,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140346762] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:04,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:04,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 15:01:04,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665126773] [2021-12-21 15:01:04,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:04,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 15:01:04,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:04,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 15:01:04,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 15:01:04,459 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 120 [2021-12-21 15:01:04,464 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 117 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:04,464 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:04,464 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 120 [2021-12-21 15:01:04,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:04,612 INFO L129 PetriNetUnfolder]: 58/327 cut-off events. [2021-12-21 15:01:04,612 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-12-21 15:01:04,614 INFO L84 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 327 events. 58/327 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1408 event pairs, 44 based on Foata normal form. 18/323 useless extension candidates. Maximal degree in co-relation 401. Up to 79 conditions per place. [2021-12-21 15:01:04,617 INFO L132 encePairwiseOnDemand]: 115/120 looper letters, 14 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2021-12-21 15:01:04,617 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 119 transitions, 285 flow [2021-12-21 15:01:04,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 15:01:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-21 15:01:04,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2021-12-21 15:01:04,632 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9416666666666667 [2021-12-21 15:01:04,632 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2021-12-21 15:01:04,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2021-12-21 15:01:04,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:04,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2021-12-21 15:01:04,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:04,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:04,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:04,648 INFO L186 Difference]: Start difference. First operand has 125 places, 117 transitions, 243 flow. Second operand 3 states and 339 transitions. [2021-12-21 15:01:04,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 119 transitions, 285 flow [2021-12-21 15:01:04,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 119 transitions, 280 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-21 15:01:04,657 INFO L242 Difference]: Finished difference. Result has 122 places, 113 transitions, 236 flow [2021-12-21 15:01:04,659 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=122, PETRI_TRANSITIONS=113} [2021-12-21 15:01:04,662 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, -3 predicate places. [2021-12-21 15:01:04,662 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 113 transitions, 236 flow [2021-12-21 15:01:04,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:04,662 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:04,662 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:04,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 15:01:04,663 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:04,663 INFO L85 PathProgramCache]: Analyzing trace with hash -141212877, now seen corresponding path program 1 times [2021-12-21 15:01:04,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:04,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607556643] [2021-12-21 15:01:04,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:04,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:04,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:04,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607556643] [2021-12-21 15:01:04,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607556643] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:04,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:04,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:01:04,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399646754] [2021-12-21 15:01:04,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:04,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:01:04,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:04,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:01:04,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:01:04,920 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2021-12-21 15:01:04,920 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 113 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:04,920 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:04,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2021-12-21 15:01:04,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:05,690 INFO L129 PetriNetUnfolder]: 1548/3915 cut-off events. [2021-12-21 15:01:05,690 INFO L130 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2021-12-21 15:01:05,699 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6460 conditions, 3915 events. 1548/3915 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 31675 event pairs, 252 based on Foata normal form. 0/3814 useless extension candidates. Maximal degree in co-relation 6401. Up to 1203 conditions per place. [2021-12-21 15:01:05,709 INFO L132 encePairwiseOnDemand]: 112/120 looper letters, 27 selfloop transitions, 4 changer transitions 66/174 dead transitions. [2021-12-21 15:01:05,709 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 174 transitions, 544 flow [2021-12-21 15:01:05,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:01:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 15:01:05,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 998 transitions. [2021-12-21 15:01:05,712 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8316666666666667 [2021-12-21 15:01:05,713 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 998 transitions. [2021-12-21 15:01:05,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 998 transitions. [2021-12-21 15:01:05,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:05,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 998 transitions. [2021-12-21 15:01:05,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.8) internal successors, (998), 10 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:05,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:05,719 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:05,719 INFO L186 Difference]: Start difference. First operand has 122 places, 113 transitions, 236 flow. Second operand 10 states and 998 transitions. [2021-12-21 15:01:05,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 174 transitions, 544 flow [2021-12-21 15:01:05,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 174 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-21 15:01:05,724 INFO L242 Difference]: Finished difference. Result has 136 places, 101 transitions, 232 flow [2021-12-21 15:01:05,725 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=232, PETRI_PLACES=136, PETRI_TRANSITIONS=101} [2021-12-21 15:01:05,725 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 11 predicate places. [2021-12-21 15:01:05,726 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 101 transitions, 232 flow [2021-12-21 15:01:05,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:05,726 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:05,726 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:05,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 15:01:05,727 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:05,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:05,727 INFO L85 PathProgramCache]: Analyzing trace with hash 687419341, now seen corresponding path program 1 times [2021-12-21 15:01:05,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:05,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391637558] [2021-12-21 15:01:05,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:05,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:05,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:05,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391637558] [2021-12-21 15:01:05,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391637558] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:05,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:05,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:01:05,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393789706] [2021-12-21 15:01:05,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:05,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:01:05,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:05,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:01:05,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:01:05,872 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 120 [2021-12-21 15:01:05,873 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 101 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:05,873 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:05,873 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 120 [2021-12-21 15:01:05,873 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:06,187 INFO L129 PetriNetUnfolder]: 459/999 cut-off events. [2021-12-21 15:01:06,187 INFO L130 PetriNetUnfolder]: For 252/252 co-relation queries the response was YES. [2021-12-21 15:01:06,189 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2008 conditions, 999 events. 459/999 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5484 event pairs, 65 based on Foata normal form. 27/1000 useless extension candidates. Maximal degree in co-relation 1944. Up to 374 conditions per place. [2021-12-21 15:01:06,192 INFO L132 encePairwiseOnDemand]: 114/120 looper letters, 21 selfloop transitions, 2 changer transitions 37/144 dead transitions. [2021-12-21 15:01:06,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 144 transitions, 458 flow [2021-12-21 15:01:06,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:01:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-21 15:01:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 944 transitions. [2021-12-21 15:01:06,195 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8740740740740741 [2021-12-21 15:01:06,195 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 944 transitions. [2021-12-21 15:01:06,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 944 transitions. [2021-12-21 15:01:06,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:06,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 944 transitions. [2021-12-21 15:01:06,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.88888888888889) internal successors, (944), 9 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:06,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:06,199 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:06,199 INFO L186 Difference]: Start difference. First operand has 136 places, 101 transitions, 232 flow. Second operand 9 states and 944 transitions. [2021-12-21 15:01:06,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 144 transitions, 458 flow [2021-12-21 15:01:06,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 144 transitions, 422 flow, removed 14 selfloop flow, removed 9 redundant places. [2021-12-21 15:01:06,210 INFO L242 Difference]: Finished difference. Result has 124 places, 101 transitions, 232 flow [2021-12-21 15:01:06,210 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=232, PETRI_PLACES=124, PETRI_TRANSITIONS=101} [2021-12-21 15:01:06,212 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, -1 predicate places. [2021-12-21 15:01:06,212 INFO L470 AbstractCegarLoop]: Abstraction has has 124 places, 101 transitions, 232 flow [2021-12-21 15:01:06,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:06,213 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:06,213 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:06,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 15:01:06,214 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:06,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:06,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1087069435, now seen corresponding path program 1 times [2021-12-21 15:01:06,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:06,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73561288] [2021-12-21 15:01:06,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:06,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:06,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:06,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:06,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73561288] [2021-12-21 15:01:06,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73561288] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:06,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:06,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 15:01:06,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980348802] [2021-12-21 15:01:06,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:06,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 15:01:06,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:06,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 15:01:06,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 15:01:06,353 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 120 [2021-12-21 15:01:06,356 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 101 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:06,356 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:06,356 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 120 [2021-12-21 15:01:06,356 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:06,710 INFO L129 PetriNetUnfolder]: 917/1963 cut-off events. [2021-12-21 15:01:06,711 INFO L130 PetriNetUnfolder]: For 121/121 co-relation queries the response was YES. [2021-12-21 15:01:06,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3685 conditions, 1963 events. 917/1963 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 13408 event pairs, 60 based on Foata normal form. 0/1923 useless extension candidates. Maximal degree in co-relation 3622. Up to 481 conditions per place. [2021-12-21 15:01:06,718 INFO L132 encePairwiseOnDemand]: 110/120 looper letters, 31 selfloop transitions, 6 changer transitions 50/168 dead transitions. [2021-12-21 15:01:06,718 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 168 transitions, 544 flow [2021-12-21 15:01:06,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:01:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 15:01:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1049 transitions. [2021-12-21 15:01:06,721 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8741666666666666 [2021-12-21 15:01:06,721 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1049 transitions. [2021-12-21 15:01:06,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1049 transitions. [2021-12-21 15:01:06,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:06,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1049 transitions. [2021-12-21 15:01:06,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.9) internal successors, (1049), 10 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-21 15:01:06,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:06,725 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:06,725 INFO L186 Difference]: Start difference. First operand has 124 places, 101 transitions, 232 flow. Second operand 10 states and 1049 transitions. [2021-12-21 15:01:06,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 168 transitions, 544 flow [2021-12-21 15:01:06,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 168 transitions, 528 flow, removed 6 selfloop flow, removed 8 redundant places. [2021-12-21 15:01:06,730 INFO L242 Difference]: Finished difference. Result has 125 places, 103 transitions, 270 flow [2021-12-21 15:01:06,730 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=270, PETRI_PLACES=125, PETRI_TRANSITIONS=103} [2021-12-21 15:01:06,731 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 0 predicate places. [2021-12-21 15:01:06,732 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 103 transitions, 270 flow [2021-12-21 15:01:06,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:06,732 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:06,732 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:06,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 15:01:06,732 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:06,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:06,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1052983942, now seen corresponding path program 1 times [2021-12-21 15:01:06,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:06,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911455182] [2021-12-21 15:01:06,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:06,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:06,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:06,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911455182] [2021-12-21 15:01:06,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911455182] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:06,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:06,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:01:06,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085625236] [2021-12-21 15:01:06,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:06,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:01:06,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:06,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:01:06,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:01:06,823 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 120 [2021-12-21 15:01:06,824 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 103 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:06,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:06,824 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 120 [2021-12-21 15:01:06,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:07,341 INFO L129 PetriNetUnfolder]: 1014/2653 cut-off events. [2021-12-21 15:01:07,342 INFO L130 PetriNetUnfolder]: For 1048/1140 co-relation queries the response was YES. [2021-12-21 15:01:07,349 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5742 conditions, 2653 events. 1014/2653 cut-off events. For 1048/1140 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 20471 event pairs, 204 based on Foata normal form. 52/2607 useless extension candidates. Maximal degree in co-relation 5673. Up to 728 conditions per place. [2021-12-21 15:01:07,358 INFO L132 encePairwiseOnDemand]: 107/120 looper letters, 68 selfloop transitions, 20 changer transitions 0/165 dead transitions. [2021-12-21 15:01:07,358 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 165 transitions, 576 flow [2021-12-21 15:01:07,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 15:01:07,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-21 15:01:07,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1069 transitions. [2021-12-21 15:01:07,361 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8098484848484848 [2021-12-21 15:01:07,361 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1069 transitions. [2021-12-21 15:01:07,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1069 transitions. [2021-12-21 15:01:07,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:07,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1069 transitions. [2021-12-21 15:01:07,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 97.18181818181819) internal successors, (1069), 11 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:07,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:07,365 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:07,365 INFO L186 Difference]: Start difference. First operand has 125 places, 103 transitions, 270 flow. Second operand 11 states and 1069 transitions. [2021-12-21 15:01:07,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 165 transitions, 576 flow [2021-12-21 15:01:07,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 165 transitions, 562 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-12-21 15:01:07,370 INFO L242 Difference]: Finished difference. Result has 132 places, 118 transitions, 396 flow [2021-12-21 15:01:07,371 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=396, PETRI_PLACES=132, PETRI_TRANSITIONS=118} [2021-12-21 15:01:07,372 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 7 predicate places. [2021-12-21 15:01:07,372 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 118 transitions, 396 flow [2021-12-21 15:01:07,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:07,373 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:07,373 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:07,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 15:01:07,374 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:07,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:07,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1945505414, now seen corresponding path program 2 times [2021-12-21 15:01:07,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:07,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558488910] [2021-12-21 15:01:07,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:07,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:07,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:07,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558488910] [2021-12-21 15:01:07,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558488910] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:07,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:07,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:01:07,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909233210] [2021-12-21 15:01:07,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:07,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:01:07,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:07,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:01:07,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:01:07,487 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 120 [2021-12-21 15:01:07,488 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 118 transitions, 396 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:07,488 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:07,488 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 120 [2021-12-21 15:01:07,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:07,917 INFO L129 PetriNetUnfolder]: 808/2028 cut-off events. [2021-12-21 15:01:07,917 INFO L130 PetriNetUnfolder]: For 2434/2563 co-relation queries the response was YES. [2021-12-21 15:01:07,924 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5456 conditions, 2028 events. 808/2028 cut-off events. For 2434/2563 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 14683 event pairs, 73 based on Foata normal form. 81/2049 useless extension candidates. Maximal degree in co-relation 5384. Up to 455 conditions per place. [2021-12-21 15:01:07,928 INFO L132 encePairwiseOnDemand]: 111/120 looper letters, 54 selfloop transitions, 19 changer transitions 28/188 dead transitions. [2021-12-21 15:01:07,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 188 transitions, 935 flow [2021-12-21 15:01:07,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 15:01:07,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 15:01:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1047 transitions. [2021-12-21 15:01:07,931 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8725 [2021-12-21 15:01:07,931 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1047 transitions. [2021-12-21 15:01:07,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1047 transitions. [2021-12-21 15:01:07,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:07,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1047 transitions. [2021-12-21 15:01:07,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.7) internal successors, (1047), 10 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:07,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:07,938 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:07,938 INFO L186 Difference]: Start difference. First operand has 132 places, 118 transitions, 396 flow. Second operand 10 states and 1047 transitions. [2021-12-21 15:01:07,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 188 transitions, 935 flow [2021-12-21 15:01:07,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 188 transitions, 924 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-12-21 15:01:07,944 INFO L242 Difference]: Finished difference. Result has 142 places, 127 transitions, 525 flow [2021-12-21 15:01:07,944 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=525, PETRI_PLACES=142, PETRI_TRANSITIONS=127} [2021-12-21 15:01:07,945 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 17 predicate places. [2021-12-21 15:01:07,945 INFO L470 AbstractCegarLoop]: Abstraction has has 142 places, 127 transitions, 525 flow [2021-12-21 15:01:07,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:07,945 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:07,945 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:07,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 15:01:07,945 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:07,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:07,946 INFO L85 PathProgramCache]: Analyzing trace with hash 919008771, now seen corresponding path program 1 times [2021-12-21 15:01:07,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:07,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053254052] [2021-12-21 15:01:07,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:07,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:08,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:08,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:08,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053254052] [2021-12-21 15:01:08,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053254052] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:08,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:08,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 15:01:08,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248297074] [2021-12-21 15:01:08,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:08,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 15:01:08,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:08,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 15:01:08,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 15:01:08,039 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 120 [2021-12-21 15:01:08,040 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 127 transitions, 525 flow. Second operand has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:08,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:08,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 120 [2021-12-21 15:01:08,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:08,438 INFO L129 PetriNetUnfolder]: 732/1774 cut-off events. [2021-12-21 15:01:08,439 INFO L130 PetriNetUnfolder]: For 3414/3564 co-relation queries the response was YES. [2021-12-21 15:01:08,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5414 conditions, 1774 events. 732/1774 cut-off events. For 3414/3564 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12894 event pairs, 68 based on Foata normal form. 36/1753 useless extension candidates. Maximal degree in co-relation 5391. Up to 420 conditions per place. [2021-12-21 15:01:08,448 INFO L132 encePairwiseOnDemand]: 111/120 looper letters, 43 selfloop transitions, 24 changer transitions 31/182 dead transitions. [2021-12-21 15:01:08,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 182 transitions, 981 flow [2021-12-21 15:01:08,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 15:01:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-21 15:01:08,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1331 transitions. [2021-12-21 15:01:08,451 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8532051282051282 [2021-12-21 15:01:08,451 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1331 transitions. [2021-12-21 15:01:08,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1331 transitions. [2021-12-21 15:01:08,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:08,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1331 transitions. [2021-12-21 15:01:08,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.38461538461539) internal successors, (1331), 13 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:08,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:08,456 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:08,456 INFO L186 Difference]: Start difference. First operand has 142 places, 127 transitions, 525 flow. Second operand 13 states and 1331 transitions. [2021-12-21 15:01:08,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 182 transitions, 981 flow [2021-12-21 15:01:08,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 182 transitions, 822 flow, removed 72 selfloop flow, removed 9 redundant places. [2021-12-21 15:01:08,479 INFO L242 Difference]: Finished difference. Result has 148 places, 124 transitions, 466 flow [2021-12-21 15:01:08,480 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=466, PETRI_PLACES=148, PETRI_TRANSITIONS=124} [2021-12-21 15:01:08,480 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 23 predicate places. [2021-12-21 15:01:08,481 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 124 transitions, 466 flow [2021-12-21 15:01:08,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:08,481 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:08,481 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:08,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 15:01:08,482 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:08,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash -568492, now seen corresponding path program 1 times [2021-12-21 15:01:08,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:08,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484248238] [2021-12-21 15:01:08,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:08,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:08,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:08,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484248238] [2021-12-21 15:01:08,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484248238] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:08,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:08,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 15:01:08,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835013333] [2021-12-21 15:01:08,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:08,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 15:01:08,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:08,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 15:01:08,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-21 15:01:08,663 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 120 [2021-12-21 15:01:08,663 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 124 transitions, 466 flow. Second operand has 8 states, 8 states have (on average 97.5) internal successors, (780), 8 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:08,663 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:08,664 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 120 [2021-12-21 15:01:08,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:08,931 INFO L129 PetriNetUnfolder]: 294/1476 cut-off events. [2021-12-21 15:01:08,931 INFO L130 PetriNetUnfolder]: For 1995/2035 co-relation queries the response was YES. [2021-12-21 15:01:08,936 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3560 conditions, 1476 events. 294/1476 cut-off events. For 1995/2035 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13830 event pairs, 14 based on Foata normal form. 1/1435 useless extension candidates. Maximal degree in co-relation 3483. Up to 156 conditions per place. [2021-12-21 15:01:08,940 INFO L132 encePairwiseOnDemand]: 110/120 looper letters, 24 selfloop transitions, 9 changer transitions 11/147 dead transitions. [2021-12-21 15:01:08,941 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 147 transitions, 638 flow [2021-12-21 15:01:08,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:01:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-21 15:01:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 897 transitions. [2021-12-21 15:01:08,943 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8305555555555556 [2021-12-21 15:01:08,943 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 897 transitions. [2021-12-21 15:01:08,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 897 transitions. [2021-12-21 15:01:08,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:08,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 897 transitions. [2021-12-21 15:01:08,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.66666666666667) internal successors, (897), 9 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:08,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:08,947 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:08,947 INFO L186 Difference]: Start difference. First operand has 148 places, 124 transitions, 466 flow. Second operand 9 states and 897 transitions. [2021-12-21 15:01:08,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 147 transitions, 638 flow [2021-12-21 15:01:08,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 147 transitions, 590 flow, removed 10 selfloop flow, removed 10 redundant places. [2021-12-21 15:01:08,962 INFO L242 Difference]: Finished difference. Result has 147 places, 132 transitions, 502 flow [2021-12-21 15:01:08,963 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=502, PETRI_PLACES=147, PETRI_TRANSITIONS=132} [2021-12-21 15:01:08,963 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 22 predicate places. [2021-12-21 15:01:08,963 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 132 transitions, 502 flow [2021-12-21 15:01:08,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 97.5) internal successors, (780), 8 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:08,964 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:08,964 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:08,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 15:01:08,964 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:08,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:08,965 INFO L85 PathProgramCache]: Analyzing trace with hash 481010874, now seen corresponding path program 2 times [2021-12-21 15:01:08,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:08,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977625540] [2021-12-21 15:01:08,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:08,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:09,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:09,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:09,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977625540] [2021-12-21 15:01:09,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977625540] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:09,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:09,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 15:01:09,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469601142] [2021-12-21 15:01:09,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:09,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 15:01:09,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:09,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 15:01:09,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-21 15:01:09,146 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 120 [2021-12-21 15:01:09,147 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 132 transitions, 502 flow. Second operand has 11 states, 11 states have (on average 85.9090909090909) internal successors, (945), 11 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:09,147 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:09,147 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 120 [2021-12-21 15:01:09,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:09,523 INFO L129 PetriNetUnfolder]: 398/1836 cut-off events. [2021-12-21 15:01:09,523 INFO L130 PetriNetUnfolder]: For 1744/1747 co-relation queries the response was YES. [2021-12-21 15:01:09,529 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4528 conditions, 1836 events. 398/1836 cut-off events. For 1744/1747 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 17806 event pairs, 24 based on Foata normal form. 1/1799 useless extension candidates. Maximal degree in co-relation 4503. Up to 200 conditions per place. [2021-12-21 15:01:09,533 INFO L132 encePairwiseOnDemand]: 106/120 looper letters, 46 selfloop transitions, 11 changer transitions 15/160 dead transitions. [2021-12-21 15:01:09,533 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 160 transitions, 794 flow [2021-12-21 15:01:09,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 15:01:09,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-21 15:01:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1051 transitions. [2021-12-21 15:01:09,535 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7298611111111111 [2021-12-21 15:01:09,535 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1051 transitions. [2021-12-21 15:01:09,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1051 transitions. [2021-12-21 15:01:09,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:09,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1051 transitions. [2021-12-21 15:01:09,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 87.58333333333333) internal successors, (1051), 12 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:09,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 120.0) internal successors, (1560), 13 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:09,540 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 120.0) internal successors, (1560), 13 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:09,540 INFO L186 Difference]: Start difference. First operand has 147 places, 132 transitions, 502 flow. Second operand 12 states and 1051 transitions. [2021-12-21 15:01:09,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 160 transitions, 794 flow [2021-12-21 15:01:09,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 160 transitions, 750 flow, removed 22 selfloop flow, removed 7 redundant places. [2021-12-21 15:01:09,559 INFO L242 Difference]: Finished difference. Result has 151 places, 132 transitions, 514 flow [2021-12-21 15:01:09,560 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=514, PETRI_PLACES=151, PETRI_TRANSITIONS=132} [2021-12-21 15:01:09,560 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 26 predicate places. [2021-12-21 15:01:09,560 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 132 transitions, 514 flow [2021-12-21 15:01:09,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 85.9090909090909) internal successors, (945), 11 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:09,561 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:09,561 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:09,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 15:01:09,561 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:09,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:09,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1339963168, now seen corresponding path program 3 times [2021-12-21 15:01:09,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:09,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534368948] [2021-12-21 15:01:09,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:09,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:01:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:01:09,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:01:09,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534368948] [2021-12-21 15:01:09,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534368948] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:01:09,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:01:09,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:01:09,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126420295] [2021-12-21 15:01:09,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:01:09,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:01:09,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:01:09,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:01:09,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:01:09,658 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 120 [2021-12-21 15:01:09,658 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 132 transitions, 514 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:09,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:01:09,658 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 120 [2021-12-21 15:01:09,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:01:09,964 INFO L129 PetriNetUnfolder]: 447/2155 cut-off events. [2021-12-21 15:01:09,964 INFO L130 PetriNetUnfolder]: For 2028/2076 co-relation queries the response was YES. [2021-12-21 15:01:09,975 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5158 conditions, 2155 events. 447/2155 cut-off events. For 2028/2076 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 21799 event pairs, 41 based on Foata normal form. 5/2096 useless extension candidates. Maximal degree in co-relation 5134. Up to 195 conditions per place. [2021-12-21 15:01:09,978 INFO L132 encePairwiseOnDemand]: 114/120 looper letters, 26 selfloop transitions, 1 changer transitions 32/161 dead transitions. [2021-12-21 15:01:09,978 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 161 transitions, 805 flow [2021-12-21 15:01:09,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:01:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-21 15:01:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 703 transitions. [2021-12-21 15:01:09,980 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8369047619047619 [2021-12-21 15:01:09,980 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 703 transitions. [2021-12-21 15:01:09,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 703 transitions. [2021-12-21 15:01:09,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:01:09,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 703 transitions. [2021-12-21 15:01:09,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.42857142857143) internal successors, (703), 7 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:09,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:09,983 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:09,983 INFO L186 Difference]: Start difference. First operand has 151 places, 132 transitions, 514 flow. Second operand 7 states and 703 transitions. [2021-12-21 15:01:09,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 161 transitions, 805 flow [2021-12-21 15:01:10,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 161 transitions, 747 flow, removed 12 selfloop flow, removed 10 redundant places. [2021-12-21 15:01:10,010 INFO L242 Difference]: Finished difference. Result has 147 places, 127 transitions, 466 flow [2021-12-21 15:01:10,010 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=466, PETRI_PLACES=147, PETRI_TRANSITIONS=127} [2021-12-21 15:01:10,010 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 22 predicate places. [2021-12-21 15:01:10,010 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 127 transitions, 466 flow [2021-12-21 15:01:10,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 15:01:10,011 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:01:10,011 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 15:01:10,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 15:01:10,011 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-21 15:01:10,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:01:10,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1655283286, now seen corresponding path program 4 times [2021-12-21 15:01:10,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:01:10,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810649839] [2021-12-21 15:01:10,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:01:10,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:01:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 15:01:10,051 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 15:01:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 15:01:10,115 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 15:01:10,115 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 15:01:10,116 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-12-21 15:01:10,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-12-21 15:01:10,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-12-21 15:01:10,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-12-21 15:01:10,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-12-21 15:01:10,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-12-21 15:01:10,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 15:01:10,120 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2021-12-21 15:01:10,124 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-21 15:01:10,124 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 15:01:10,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:01:10 BasicIcfg [2021-12-21 15:01:10,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 15:01:10,228 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 15:01:10,228 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 15:01:10,229 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 15:01:10,229 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:01:03" (3/4) ... [2021-12-21 15:01:10,230 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-21 15:01:10,322 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 15:01:10,323 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 15:01:10,323 INFO L158 Benchmark]: Toolchain (without parser) took 7712.30ms. Allocated memory was 98.6MB in the beginning and 671.1MB in the end (delta: 572.5MB). Free memory was 66.6MB in the beginning and 296.9MB in the end (delta: -230.3MB). Peak memory consumption was 342.5MB. Max. memory is 16.1GB. [2021-12-21 15:01:10,323 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 79.7MB. Free memory was 48.8MB in the beginning and 48.7MB in the end (delta: 48.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 15:01:10,323 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.70ms. Allocated memory is still 98.6MB. Free memory was 66.4MB in the beginning and 43.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-21 15:01:10,323 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.65ms. Allocated memory is still 98.6MB. Free memory was 43.3MB in the beginning and 40.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 15:01:10,324 INFO L158 Benchmark]: Boogie Preprocessor took 53.49ms. Allocated memory is still 98.6MB. Free memory was 40.8MB in the beginning and 38.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 15:01:10,324 INFO L158 Benchmark]: RCFGBuilder took 835.53ms. Allocated memory is still 98.6MB. Free memory was 38.5MB in the beginning and 43.5MB in the end (delta: -5.0MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2021-12-21 15:01:10,324 INFO L158 Benchmark]: TraceAbstraction took 6262.84ms. Allocated memory was 98.6MB in the beginning and 671.1MB in the end (delta: 572.5MB). Free memory was 42.9MB in the beginning and 337.8MB in the end (delta: -294.9MB). Peak memory consumption was 277.1MB. Max. memory is 16.1GB. [2021-12-21 15:01:10,324 INFO L158 Benchmark]: Witness Printer took 94.23ms. Allocated memory is still 671.1MB. Free memory was 337.8MB in the beginning and 296.9MB in the end (delta: 40.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2021-12-21 15:01:10,326 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.15ms. Allocated memory is still 79.7MB. Free memory was 48.8MB in the beginning and 48.7MB in the end (delta: 48.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.70ms. Allocated memory is still 98.6MB. Free memory was 66.4MB in the beginning and 43.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.65ms. Allocated memory is still 98.6MB. Free memory was 43.3MB in the beginning and 40.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.49ms. Allocated memory is still 98.6MB. Free memory was 40.8MB in the beginning and 38.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 835.53ms. Allocated memory is still 98.6MB. Free memory was 38.5MB in the beginning and 43.5MB in the end (delta: -5.0MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6262.84ms. Allocated memory was 98.6MB in the beginning and 671.1MB in the end (delta: 572.5MB). Free memory was 42.9MB in the beginning and 337.8MB in the end (delta: -294.9MB). Peak memory consumption was 277.1MB. Max. memory is 16.1GB. * Witness Printer took 94.23ms. Allocated memory is still 671.1MB. Free memory was 337.8MB in the beginning and 296.9MB in the end (delta: 40.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L719] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L720] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L721] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L723] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L725] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L728] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L729] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L730] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L731] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L732] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L733] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L738] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L739] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L740] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L741] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L742] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L743] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t62; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t62={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] FCALL, FORK 0 pthread_create(&t62, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t62, ((void *)0), P0, ((void *)0))=-2, t62={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t63; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t62={5:0}, t63={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] FCALL, FORK 0 pthread_create(&t63, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t63, ((void *)0), P1, ((void *)0))=-1, t62={5:0}, t63={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$w_buff1 = z$w_buff0 [L750] 1 z$w_buff0 = 1 [L751] 1 z$w_buff1_used = z$w_buff0_used [L752] 1 z$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L754] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L755] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L756] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L757] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L758] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 pthread_t t64; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L850] FCALL, FORK 0 pthread_create(&t64, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t64, ((void *)0), P2, ((void *)0))=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 z$flush_delayed = weak$$choice2 [L810] 3 z$mem_tmp = z [L811] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L811] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L812] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L812] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L812] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L812] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L813] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L813] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L813] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L813] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L814] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L814] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L814] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L814] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L815] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L816] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L816] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L816] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L817] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L817] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EBX = z [L819] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L819] 3 z = z$flush_delayed ? z$mem_tmp : z [L820] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L788] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L789] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L789] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L790] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L790] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L791] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L791] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L764] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L766] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L768] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L823] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L823] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L825] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L826] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L827] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L860] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 850]: 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: 846]: 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: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 493 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 493 mSDsluCounter, 570 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1044 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1341 IncrementalHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 122 mSDtfsCounter, 1341 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=525occurred in iteration=6, InterpolantAutomatonStates: 94, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 925 NumberOfCodeBlocks, 925 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 821 ConstructedInterpolants, 0 QuantifiedInterpolants, 4412 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-21 15:01:10,352 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