/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-13 07:22:37,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-13 07:22:37,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-13 07:22:37,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-13 07:22:37,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-13 07:22:37,814 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-13 07:22:37,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-13 07:22:37,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-13 07:22:37,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-13 07:22:37,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-13 07:22:37,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-13 07:22:37,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-13 07:22:37,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-13 07:22:37,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-13 07:22:37,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-13 07:22:37,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-13 07:22:37,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-13 07:22:37,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-13 07:22:37,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-13 07:22:37,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-13 07:22:37,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-13 07:22:37,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-13 07:22:37,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-13 07:22:37,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-13 07:22:37,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-13 07:22:37,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-13 07:22:37,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-13 07:22:37,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-13 07:22:37,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-13 07:22:37,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-13 07:22:37,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-13 07:22:37,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-13 07:22:37,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-13 07:22:37,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-13 07:22:37,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-13 07:22:37,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-13 07:22:37,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-13 07:22:37,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-13 07:22:37,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-13 07:22:37,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-13 07:22:37,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-13 07:22:37,869 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2021-06-13 07:22:37,904 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-13 07:22:37,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-13 07:22:37,907 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-13 07:22:37,907 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-13 07:22:37,907 INFO L138 SettingsManager]: * Use SBE=true [2021-06-13 07:22:37,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-13 07:22:37,907 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-13 07:22:37,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-13 07:22:37,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-13 07:22:37,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-13 07:22:37,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-13 07:22:37,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-13 07:22:37,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-13 07:22:37,909 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-13 07:22:37,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-13 07:22:37,909 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-13 07:22:37,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-13 07:22:37,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-13 07:22:37,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-13 07:22:37,910 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-13 07:22:37,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-13 07:22:37,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-13 07:22:37,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-13 07:22:37,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-13 07:22:37,911 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-13 07:22:37,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-13 07:22:37,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-13 07:22:37,911 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-13 07:22:37,911 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-13 07:22:37,911 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 [2021-06-13 07:22:38,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-13 07:22:38,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-13 07:22:38,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-13 07:22:38,259 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-13 07:22:38,259 INFO L275 PluginConnector]: CDTParser initialized [2021-06-13 07:22:38,260 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_rmo.opt.i [2021-06-13 07:22:38,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebd7b85ed/ab91f75b7c8e4d328921744c39f8b517/FLAG2ca4592a2 [2021-06-13 07:22:38,802 INFO L306 CDTParser]: Found 1 translation units. [2021-06-13 07:22:38,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_rmo.opt.i [2021-06-13 07:22:38,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebd7b85ed/ab91f75b7c8e4d328921744c39f8b517/FLAG2ca4592a2 [2021-06-13 07:22:39,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebd7b85ed/ab91f75b7c8e4d328921744c39f8b517 [2021-06-13 07:22:39,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-13 07:22:39,117 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-13 07:22:39,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-13 07:22:39,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-13 07:22:39,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-13 07:22:39,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.06 07:22:39" (1/1) ... [2021-06-13 07:22:39,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68734ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:22:39, skipping insertion in model container [2021-06-13 07:22:39,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.06 07:22:39" (1/1) ... [2021-06-13 07:22:39,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-13 07:22:39,182 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-13 07:22:39,393 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_rmo.opt.i[948,961] [2021-06-13 07:22:39,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-13 07:22:39,587 INFO L203 MainTranslator]: Completed pre-run [2021-06-13 07:22:39,596 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_rmo.opt.i[948,961] [2021-06-13 07:22:39,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-13 07:22:39,705 INFO L208 MainTranslator]: Completed translation [2021-06-13 07:22:39,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:22:39 WrapperNode [2021-06-13 07:22:39,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-13 07:22:39,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-13 07:22:39,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-13 07:22:39,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-13 07:22:39,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:22:39" (1/1) ... [2021-06-13 07:22:39,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:22:39" (1/1) ... [2021-06-13 07:22:39,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-13 07:22:39,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-13 07:22:39,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-13 07:22:39,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-13 07:22:39,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:22:39" (1/1) ... [2021-06-13 07:22:39,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:22:39" (1/1) ... [2021-06-13 07:22:39,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:22:39" (1/1) ... [2021-06-13 07:22:39,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:22:39" (1/1) ... [2021-06-13 07:22:39,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:22:39" (1/1) ... [2021-06-13 07:22:39,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:22:39" (1/1) ... [2021-06-13 07:22:39,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:22:39" (1/1) ... [2021-06-13 07:22:39,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-13 07:22:39,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-13 07:22:39,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-13 07:22:39,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-13 07:22:39,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:22:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-13 07:22:39,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-13 07:22:39,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-13 07:22:39,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-13 07:22:39,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-13 07:22:39,889 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-13 07:22:39,890 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-13 07:22:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-13 07:22:39,890 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-13 07:22:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-13 07:22:39,890 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-13 07:22:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-13 07:22:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-13 07:22:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-13 07:22:39,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-13 07:22:39,892 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-13 07:22:41,296 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-13 07:22:41,296 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-13 07:22:41,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.06 07:22:41 BoogieIcfgContainer [2021-06-13 07:22:41,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-13 07:22:41,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-13 07:22:41,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-13 07:22:41,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-13 07:22:41,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.06 07:22:39" (1/3) ... [2021-06-13 07:22:41,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aefb02c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.06 07:22:41, skipping insertion in model container [2021-06-13 07:22:41,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:22:39" (2/3) ... [2021-06-13 07:22:41,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aefb02c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.06 07:22:41, skipping insertion in model container [2021-06-13 07:22:41,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.06 07:22:41" (3/3) ... [2021-06-13 07:22:41,304 INFO L111 eAbstractionObserver]: Analyzing ICFG mix052_rmo.opt.i [2021-06-13 07:22:41,309 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-13 07:22:41,310 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-13 07:22:41,310 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-13 07:22:41,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,341 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,341 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,342 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,342 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,343 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,343 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,343 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,343 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,356 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,356 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,356 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,357 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,357 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,357 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,357 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,358 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,362 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,363 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,363 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,365 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,365 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,367 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,369 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:22:41,370 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-13 07:22:41,388 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-13 07:22:41,403 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 07:22:41,403 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 07:22:41,403 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 07:22:41,403 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 07:22:41,403 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 07:22:41,403 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 07:22:41,403 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 07:22:41,403 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2Thread1of1ForFork0======== [2021-06-13 07:22:41,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2021-06-13 07:22:41,445 INFO L129 PetriNetUnfolder]: 2/102 cut-off events. [2021-06-13 07:22:41,446 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:22:41,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2021-06-13 07:22:41,449 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2021-06-13 07:22:41,453 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2021-06-13 07:22:41,465 INFO L129 PetriNetUnfolder]: 0/68 cut-off events. [2021-06-13 07:22:41,465 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:22:41,466 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:22:41,466 INFO L255 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] [2021-06-13 07:22:41,466 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:22:41,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:22:41,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1020107950, now seen corresponding path program 1 times [2021-06-13 07:22:41,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:22:41,478 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289176153] [2021-06-13 07:22:41,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:22:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:22:41,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:41,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:22:41,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:41,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:22:41,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:22:41,756 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:22:41,756 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289176153] [2021-06-13 07:22:41,757 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289176153] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:22:41,757 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:22:41,761 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-13 07:22:41,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531860442] [2021-06-13 07:22:41,769 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-13 07:22:41,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:22:41,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-13 07:22:41,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-13 07:22:41,784 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 105 [2021-06-13 07:22:41,789 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:41,790 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:22:41,790 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 105 [2021-06-13 07:22:41,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:22:41,875 INFO L129 PetriNetUnfolder]: 9/159 cut-off events. [2021-06-13 07:22:41,875 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:22:41,877 INFO L84 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 159 events. 9/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 304 event pairs, 3 based on Foata normal form. 5/155 useless extension candidates. Maximal degree in co-relation 143. Up to 17 conditions per place. [2021-06-13 07:22:41,900 INFO L132 encePairwiseOnDemand]: 100/105 looper letters, 0 selfloop transitions, 0 changer transitions 100/100 dead transitions. [2021-06-13 07:22:41,901 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 100 transitions, 223 flow [2021-06-13 07:22:41,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 07:22:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-13 07:22:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2021-06-13 07:22:41,924 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2021-06-13 07:22:41,925 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 300 transitions. [2021-06-13 07:22:41,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 300 transitions. [2021-06-13 07:22:41,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:22:41,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 300 transitions. [2021-06-13 07:22:41,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:41,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:41,946 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:41,947 INFO L185 Difference]: Start difference. First operand has 110 places, 102 transitions, 213 flow. Second operand 3 states and 300 transitions. [2021-06-13 07:22:41,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 100 transitions, 223 flow [2021-06-13 07:22:41,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 100 transitions, 220 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-13 07:22:41,951 INFO L241 Difference]: Finished difference. Result has 107 places, 0 transitions, 0 flow [2021-06-13 07:22:41,953 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=107, PETRI_TRANSITIONS=0} [2021-06-13 07:22:41,953 INFO L335 CegarLoopForPetriNet]: 110 programPoint places, -3 predicate places. [2021-06-13 07:22:41,954 INFO L482 AbstractCegarLoop]: Abstraction has has 107 places, 0 transitions, 0 flow [2021-06-13 07:22:41,954 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:41,954 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-13 07:22:41,955 INFO L301 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork0 was SAFE (1/3) [2021-06-13 07:22:41,956 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-13 07:22:41,958 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 07:22:41,958 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 07:22:41,958 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 07:22:41,958 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 07:22:41,958 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 07:22:41,958 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 07:22:41,958 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 07:22:41,958 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2======== [2021-06-13 07:22:41,960 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2021-06-13 07:22:41,969 INFO L129 PetriNetUnfolder]: 2/102 cut-off events. [2021-06-13 07:22:41,970 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:22:41,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2021-06-13 07:22:41,970 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2021-06-13 07:22:41,970 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2021-06-13 07:22:41,971 INFO L129 PetriNetUnfolder]: 0/0 cut-off events. [2021-06-13 07:22:41,971 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:22:41,971 INFO L301 ceAbstractionStarter]: Result for error location P2 was SAFE (2/3) [2021-06-13 07:22:41,972 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-13 07:22:41,973 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 07:22:41,973 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 07:22:41,973 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 07:22:41,973 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 07:22:41,973 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 07:22:41,973 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 07:22:41,973 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 07:22:41,973 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-13 07:22:41,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2021-06-13 07:22:41,985 INFO L129 PetriNetUnfolder]: 2/102 cut-off events. [2021-06-13 07:22:41,985 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:22:41,985 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2021-06-13 07:22:41,985 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2021-06-13 07:22:41,986 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 90 transitions, 189 flow [2021-06-13 07:22:41,995 INFO L129 PetriNetUnfolder]: 1/89 cut-off events. [2021-06-13 07:22:41,995 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:22:41,996 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:22:41,996 INFO L255 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] [2021-06-13 07:22:41,996 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:22:41,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:22:41,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1776749645, now seen corresponding path program 1 times [2021-06-13 07:22:41,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:22:41,997 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236195657] [2021-06-13 07:22:41,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:22:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:22:42,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:42,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:22:42,147 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-06-13 07:22:42,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-13 07:22:42,157 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:22:42,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:22:42,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:42,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:22:42,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:42,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:22:42,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:42,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:22:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:22:42,198 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:22:42,199 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236195657] [2021-06-13 07:22:42,199 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236195657] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:22:42,200 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:22:42,200 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-13 07:22:42,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130778795] [2021-06-13 07:22:42,201 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-13 07:22:42,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:22:42,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-13 07:22:42,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-13 07:22:42,203 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 105 [2021-06-13 07:22:42,204 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 90 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:42,204 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:22:42,204 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 105 [2021-06-13 07:22:42,204 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:22:42,496 INFO L129 PetriNetUnfolder]: 194/665 cut-off events. [2021-06-13 07:22:42,496 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:22:42,499 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 665 events. 194/665 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4210 event pairs, 48 based on Foata normal form. 23/666 useless extension candidates. Maximal degree in co-relation 982. Up to 148 conditions per place. [2021-06-13 07:22:42,502 INFO L132 encePairwiseOnDemand]: 95/105 looper letters, 16 selfloop transitions, 5 changer transitions 31/128 dead transitions. [2021-06-13 07:22:42,502 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 128 transitions, 369 flow [2021-06-13 07:22:42,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-13 07:22:42,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-13 07:22:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 848 transitions. [2021-06-13 07:22:42,505 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8973544973544973 [2021-06-13 07:22:42,505 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 848 transitions. [2021-06-13 07:22:42,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 848 transitions. [2021-06-13 07:22:42,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:22:42,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 848 transitions. [2021-06-13 07:22:42,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.22222222222223) internal successors, (848), 9 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:42,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:42,512 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:42,512 INFO L185 Difference]: Start difference. First operand has 99 places, 90 transitions, 189 flow. Second operand 9 states and 848 transitions. [2021-06-13 07:22:42,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 128 transitions, 369 flow [2021-06-13 07:22:42,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 128 transitions, 366 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-13 07:22:42,516 INFO L241 Difference]: Finished difference. Result has 112 places, 93 transitions, 258 flow [2021-06-13 07:22:42,516 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=258, PETRI_PLACES=112, PETRI_TRANSITIONS=93} [2021-06-13 07:22:42,517 INFO L335 CegarLoopForPetriNet]: 99 programPoint places, 13 predicate places. [2021-06-13 07:22:42,517 INFO L482 AbstractCegarLoop]: Abstraction has has 112 places, 93 transitions, 258 flow [2021-06-13 07:22:42,517 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:42,517 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:22:42,517 INFO L255 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] [2021-06-13 07:22:42,517 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-13 07:22:42,518 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:22:42,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:22:42,518 INFO L82 PathProgramCache]: Analyzing trace with hash -569462638, now seen corresponding path program 1 times [2021-06-13 07:22:42,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:22:42,518 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659741632] [2021-06-13 07:22:42,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:22:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:22:42,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:42,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:22:42,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:42,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:22:42,587 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-13 07:22:42,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-13 07:22:42,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:42,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:22:42,611 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-13 07:22:42,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:22:42,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:42,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:22:42,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:22:42,621 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:22:42,621 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659741632] [2021-06-13 07:22:42,622 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659741632] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:22:42,622 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:22:42,622 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-13 07:22:42,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897763776] [2021-06-13 07:22:42,623 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-13 07:22:42,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:22:42,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-13 07:22:42,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-13 07:22:42,625 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 105 [2021-06-13 07:22:42,625 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 93 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:42,625 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:22:42,626 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 105 [2021-06-13 07:22:42,626 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:22:42,899 INFO L129 PetriNetUnfolder]: 442/1168 cut-off events. [2021-06-13 07:22:42,900 INFO L130 PetriNetUnfolder]: For 510/552 co-relation queries the response was YES. [2021-06-13 07:22:42,906 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2372 conditions, 1168 events. 442/1168 cut-off events. For 510/552 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 8788 event pairs, 46 based on Foata normal form. 12/1058 useless extension candidates. Maximal degree in co-relation 2316. Up to 290 conditions per place. [2021-06-13 07:22:42,913 INFO L132 encePairwiseOnDemand]: 95/105 looper letters, 24 selfloop transitions, 17 changer transitions 0/123 dead transitions. [2021-06-13 07:22:42,914 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 123 transitions, 400 flow [2021-06-13 07:22:42,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-13 07:22:42,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-13 07:22:42,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 953 transitions. [2021-06-13 07:22:42,917 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9076190476190477 [2021-06-13 07:22:42,917 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 953 transitions. [2021-06-13 07:22:42,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 953 transitions. [2021-06-13 07:22:42,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:22:42,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 953 transitions. [2021-06-13 07:22:42,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.3) internal successors, (953), 10 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:42,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 105.0) internal successors, (1155), 11 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:42,926 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 105.0) internal successors, (1155), 11 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:42,926 INFO L185 Difference]: Start difference. First operand has 112 places, 93 transitions, 258 flow. Second operand 10 states and 953 transitions. [2021-06-13 07:22:42,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 123 transitions, 400 flow [2021-06-13 07:22:42,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 123 transitions, 384 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-06-13 07:22:42,934 INFO L241 Difference]: Finished difference. Result has 119 places, 108 transitions, 362 flow [2021-06-13 07:22:42,935 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=362, PETRI_PLACES=119, PETRI_TRANSITIONS=108} [2021-06-13 07:22:42,935 INFO L335 CegarLoopForPetriNet]: 99 programPoint places, 20 predicate places. [2021-06-13 07:22:42,935 INFO L482 AbstractCegarLoop]: Abstraction has has 119 places, 108 transitions, 362 flow [2021-06-13 07:22:42,936 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:42,936 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:22:42,936 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:22:42,936 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-13 07:22:42,937 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:22:42,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:22:42,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1594402447, now seen corresponding path program 1 times [2021-06-13 07:22:42,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:22:42,938 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170034860] [2021-06-13 07:22:42,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:22:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:22:43,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:43,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:22:43,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:43,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:22:43,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:43,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:22:43,108 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-13 07:22:43,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-13 07:22:43,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:43,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:22:43,138 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-13 07:22:43,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:22:43,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:43,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:22:43,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:22:43,151 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:22:43,152 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170034860] [2021-06-13 07:22:43,152 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170034860] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:22:43,152 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:22:43,152 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-13 07:22:43,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165881054] [2021-06-13 07:22:43,153 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-13 07:22:43,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:22:43,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-13 07:22:43,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-13 07:22:43,155 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 105 [2021-06-13 07:22:43,157 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 108 transitions, 362 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:43,157 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:22:43,157 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 105 [2021-06-13 07:22:43,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:22:43,479 INFO L129 PetriNetUnfolder]: 383/1116 cut-off events. [2021-06-13 07:22:43,480 INFO L130 PetriNetUnfolder]: For 2275/2764 co-relation queries the response was YES. [2021-06-13 07:22:43,486 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3585 conditions, 1116 events. 383/1116 cut-off events. For 2275/2764 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 8800 event pairs, 10 based on Foata normal form. 114/1142 useless extension candidates. Maximal degree in co-relation 3522. Up to 388 conditions per place. [2021-06-13 07:22:43,491 INFO L132 encePairwiseOnDemand]: 95/105 looper letters, 20 selfloop transitions, 32 changer transitions 9/143 dead transitions. [2021-06-13 07:22:43,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 143 transitions, 708 flow [2021-06-13 07:22:43,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-13 07:22:43,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-06-13 07:22:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1240 transitions. [2021-06-13 07:22:43,495 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9084249084249084 [2021-06-13 07:22:43,495 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1240 transitions. [2021-06-13 07:22:43,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1240 transitions. [2021-06-13 07:22:43,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:22:43,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1240 transitions. [2021-06-13 07:22:43,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.38461538461539) internal successors, (1240), 13 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:43,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 105.0) internal successors, (1470), 14 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:43,502 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 105.0) internal successors, (1470), 14 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:43,502 INFO L185 Difference]: Start difference. First operand has 119 places, 108 transitions, 362 flow. Second operand 13 states and 1240 transitions. [2021-06-13 07:22:43,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 143 transitions, 708 flow [2021-06-13 07:22:43,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 143 transitions, 700 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-06-13 07:22:43,511 INFO L241 Difference]: Finished difference. Result has 131 places, 128 transitions, 597 flow [2021-06-13 07:22:43,511 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=597, PETRI_PLACES=131, PETRI_TRANSITIONS=128} [2021-06-13 07:22:43,511 INFO L335 CegarLoopForPetriNet]: 99 programPoint places, 32 predicate places. [2021-06-13 07:22:43,511 INFO L482 AbstractCegarLoop]: Abstraction has has 131 places, 128 transitions, 597 flow [2021-06-13 07:22:43,512 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:43,512 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:22:43,512 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:22:43,512 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-13 07:22:43,512 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:22:43,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:22:43,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1492049609, now seen corresponding path program 1 times [2021-06-13 07:22:43,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:22:43,513 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527556557] [2021-06-13 07:22:43,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:22:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:22:43,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:43,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:22:43,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:43,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:22:43,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:43,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:22:43,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:43,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:22:43,593 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-13 07:22:43,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-13 07:22:43,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:43,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:22:43,617 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-13 07:22:43,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:22:43,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:43,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:22:43,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:22:43,627 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:22:43,628 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527556557] [2021-06-13 07:22:43,628 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527556557] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:22:43,628 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:22:43,628 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-13 07:22:43,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963977566] [2021-06-13 07:22:43,628 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-13 07:22:43,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:22:43,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-13 07:22:43,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-13 07:22:43,630 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 105 [2021-06-13 07:22:43,631 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 128 transitions, 597 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:43,631 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:22:43,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 105 [2021-06-13 07:22:43,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:22:43,999 INFO L129 PetriNetUnfolder]: 308/999 cut-off events. [2021-06-13 07:22:43,999 INFO L130 PetriNetUnfolder]: For 3687/4336 co-relation queries the response was YES. [2021-06-13 07:22:44,005 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3849 conditions, 999 events. 308/999 cut-off events. For 3687/4336 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 8191 event pairs, 2 based on Foata normal form. 109/1021 useless extension candidates. Maximal degree in co-relation 3783. Up to 315 conditions per place. [2021-06-13 07:22:44,010 INFO L132 encePairwiseOnDemand]: 95/105 looper letters, 16 selfloop transitions, 36 changer transitions 20/154 dead transitions. [2021-06-13 07:22:44,010 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 154 transitions, 915 flow [2021-06-13 07:22:44,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-13 07:22:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-06-13 07:22:44,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1512 transitions. [2021-06-13 07:22:44,014 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9 [2021-06-13 07:22:44,014 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1512 transitions. [2021-06-13 07:22:44,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1512 transitions. [2021-06-13 07:22:44,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:22:44,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1512 transitions. [2021-06-13 07:22:44,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 94.5) internal successors, (1512), 16 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:44,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 105.0) internal successors, (1785), 17 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:44,022 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 105.0) internal successors, (1785), 17 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:44,022 INFO L185 Difference]: Start difference. First operand has 131 places, 128 transitions, 597 flow. Second operand 16 states and 1512 transitions. [2021-06-13 07:22:44,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 154 transitions, 915 flow [2021-06-13 07:22:44,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 154 transitions, 757 flow, removed 66 selfloop flow, removed 6 redundant places. [2021-06-13 07:22:44,049 INFO L241 Difference]: Finished difference. Result has 147 places, 128 transitions, 589 flow [2021-06-13 07:22:44,049 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=589, PETRI_PLACES=147, PETRI_TRANSITIONS=128} [2021-06-13 07:22:44,049 INFO L335 CegarLoopForPetriNet]: 99 programPoint places, 48 predicate places. [2021-06-13 07:22:44,049 INFO L482 AbstractCegarLoop]: Abstraction has has 147 places, 128 transitions, 589 flow [2021-06-13 07:22:44,050 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:44,050 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:22:44,050 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:22:44,050 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-13 07:22:44,050 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:22:44,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:22:44,051 INFO L82 PathProgramCache]: Analyzing trace with hash 352593729, now seen corresponding path program 1 times [2021-06-13 07:22:44,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:22:44,051 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437807047] [2021-06-13 07:22:44,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:22:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:22:44,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:44,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:22:44,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:44,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:22:44,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:44,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:22:44,141 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-06-13 07:22:44,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-13 07:22:44,151 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:22:44,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:22:44,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:44,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:22:44,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:44,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:22:44,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:44,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:22:44,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:22:44,194 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:22:44,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437807047] [2021-06-13 07:22:44,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437807047] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:22:44,194 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:22:44,194 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-13 07:22:44,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363159227] [2021-06-13 07:22:44,195 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-13 07:22:44,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:22:44,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-13 07:22:44,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-06-13 07:22:44,197 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 105 [2021-06-13 07:22:44,197 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 128 transitions, 589 flow. Second operand has 8 states, 8 states have (on average 87.875) internal successors, (703), 8 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-06-13 07:22:44,198 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:22:44,198 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 105 [2021-06-13 07:22:44,198 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:22:44,428 INFO L129 PetriNetUnfolder]: 282/1216 cut-off events. [2021-06-13 07:22:44,428 INFO L130 PetriNetUnfolder]: For 2428/2682 co-relation queries the response was YES. [2021-06-13 07:22:44,435 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3584 conditions, 1216 events. 282/1216 cut-off events. For 2428/2682 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 11318 event pairs, 1 based on Foata normal form. 5/1137 useless extension candidates. Maximal degree in co-relation 3510. Up to 146 conditions per place. [2021-06-13 07:22:44,438 INFO L132 encePairwiseOnDemand]: 95/105 looper letters, 13 selfloop transitions, 7 changer transitions 19/143 dead transitions. [2021-06-13 07:22:44,438 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 143 transitions, 727 flow [2021-06-13 07:22:44,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-13 07:22:44,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-13 07:22:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 807 transitions. [2021-06-13 07:22:44,440 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8539682539682539 [2021-06-13 07:22:44,440 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 807 transitions. [2021-06-13 07:22:44,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 807 transitions. [2021-06-13 07:22:44,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:22:44,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 807 transitions. [2021-06-13 07:22:44,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 89.66666666666667) internal successors, (807), 9 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:44,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:44,445 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:44,445 INFO L185 Difference]: Start difference. First operand has 147 places, 128 transitions, 589 flow. Second operand 9 states and 807 transitions. [2021-06-13 07:22:44,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 143 transitions, 727 flow [2021-06-13 07:22:44,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 143 transitions, 640 flow, removed 19 selfloop flow, removed 14 redundant places. [2021-06-13 07:22:44,471 INFO L241 Difference]: Finished difference. Result has 143 places, 123 transitions, 520 flow [2021-06-13 07:22:44,471 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=520, PETRI_PLACES=143, PETRI_TRANSITIONS=123} [2021-06-13 07:22:44,471 INFO L335 CegarLoopForPetriNet]: 99 programPoint places, 44 predicate places. [2021-06-13 07:22:44,471 INFO L482 AbstractCegarLoop]: Abstraction has has 143 places, 123 transitions, 520 flow [2021-06-13 07:22:44,472 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 87.875) internal successors, (703), 8 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-06-13 07:22:44,472 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:22:44,472 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:22:44,472 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-13 07:22:44,472 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:22:44,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:22:44,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2026838581, now seen corresponding path program 2 times [2021-06-13 07:22:44,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:22:44,473 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711922305] [2021-06-13 07:22:44,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:22:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:22:44,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:44,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:22:44,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:44,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:22:44,535 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-06-13 07:22:44,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-13 07:22:44,542 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:22:44,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:22:44,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:44,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:22:44,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:44,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:22:44,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:22:44,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:22:44,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:22:44,577 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:22:44,577 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711922305] [2021-06-13 07:22:44,577 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711922305] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:22:44,577 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:22:44,577 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-13 07:22:44,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226399456] [2021-06-13 07:22:44,578 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-13 07:22:44,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:22:44,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-13 07:22:44,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-13 07:22:44,579 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 105 [2021-06-13 07:22:44,580 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 123 transitions, 520 flow. Second operand has 7 states, 7 states have (on average 89.85714285714286) internal successors, (629), 7 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:44,580 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:22:44,580 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 105 [2021-06-13 07:22:44,580 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:22:44,734 INFO L129 PetriNetUnfolder]: 123/686 cut-off events. [2021-06-13 07:22:44,734 INFO L130 PetriNetUnfolder]: For 957/1003 co-relation queries the response was YES. [2021-06-13 07:22:44,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1892 conditions, 686 events. 123/686 cut-off events. For 957/1003 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5587 event pairs, 1 based on Foata normal form. 5/657 useless extension candidates. Maximal degree in co-relation 1868. Up to 93 conditions per place. [2021-06-13 07:22:44,738 INFO L132 encePairwiseOnDemand]: 97/105 looper letters, 9 selfloop transitions, 4 changer transitions 34/127 dead transitions. [2021-06-13 07:22:44,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 127 transitions, 578 flow [2021-06-13 07:22:44,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-13 07:22:44,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-13 07:22:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 638 transitions. [2021-06-13 07:22:44,740 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8680272108843538 [2021-06-13 07:22:44,740 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 638 transitions. [2021-06-13 07:22:44,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 638 transitions. [2021-06-13 07:22:44,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:22:44,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 638 transitions. [2021-06-13 07:22:44,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:44,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:44,744 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:44,744 INFO L185 Difference]: Start difference. First operand has 143 places, 123 transitions, 520 flow. Second operand 7 states and 638 transitions. [2021-06-13 07:22:44,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 127 transitions, 578 flow [2021-06-13 07:22:44,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 127 transitions, 554 flow, removed 7 selfloop flow, removed 6 redundant places. [2021-06-13 07:22:44,754 INFO L241 Difference]: Finished difference. Result has 142 places, 93 transitions, 306 flow [2021-06-13 07:22:44,754 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=306, PETRI_PLACES=142, PETRI_TRANSITIONS=93} [2021-06-13 07:22:44,754 INFO L335 CegarLoopForPetriNet]: 99 programPoint places, 43 predicate places. [2021-06-13 07:22:44,754 INFO L482 AbstractCegarLoop]: Abstraction has has 142 places, 93 transitions, 306 flow [2021-06-13 07:22:44,754 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 89.85714285714286) internal successors, (629), 7 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:22:44,755 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:22:44,755 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:22:44,755 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-13 07:22:44,756 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:22:44,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:22:44,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2085784719, now seen corresponding path program 3 times [2021-06-13 07:22:44,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:22:44,756 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560282026] [2021-06-13 07:22:44,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:22:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-13 07:22:44,795 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-13 07:22:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-13 07:22:44,838 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-13 07:22:44,883 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-13 07:22:44,884 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-13 07:22:44,884 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-13 07:22:44,884 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3) [2021-06-13 07:22:44,885 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-13 07:22:45,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.06 07:22:45 BasicIcfg [2021-06-13 07:22:45,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-13 07:22:45,047 INFO L168 Benchmark]: Toolchain (without parser) took 5929.02 ms. Allocated memory was 211.8 MB in the beginning and 338.7 MB in the end (delta: 126.9 MB). Free memory was 190.6 MB in the beginning and 220.6 MB in the end (delta: -30.1 MB). Peak memory consumption was 96.1 MB. Max. memory is 8.0 GB. [2021-06-13 07:22:45,047 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 127.9 MB. Free memory is still 108.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-13 07:22:45,049 INFO L168 Benchmark]: CACSL2BoogieTranslator took 586.72 ms. Allocated memory is still 211.8 MB. Free memory was 190.3 MB in the beginning and 170.9 MB in the end (delta: 19.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. [2021-06-13 07:22:45,049 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.61 ms. Allocated memory is still 211.8 MB. Free memory was 170.9 MB in the beginning and 168.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-13 07:22:45,051 INFO L168 Benchmark]: Boogie Preprocessor took 39.41 ms. Allocated memory is still 211.8 MB. Free memory was 168.3 MB in the beginning and 166.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-13 07:22:45,052 INFO L168 Benchmark]: RCFGBuilder took 1481.94 ms. Allocated memory was 211.8 MB in the beginning and 254.8 MB in the end (delta: 43.0 MB). Free memory was 166.2 MB in the beginning and 187.5 MB in the end (delta: -21.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 8.0 GB. [2021-06-13 07:22:45,054 INFO L168 Benchmark]: TraceAbstraction took 3745.69 ms. Allocated memory was 254.8 MB in the beginning and 338.7 MB in the end (delta: 83.9 MB). Free memory was 186.9 MB in the beginning and 220.6 MB in the end (delta: -33.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 8.0 GB. [2021-06-13 07:22:45,060 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.11 ms. Allocated memory is still 127.9 MB. Free memory is still 108.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 586.72 ms. Allocated memory is still 211.8 MB. Free memory was 190.3 MB in the beginning and 170.9 MB in the end (delta: 19.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 68.61 ms. Allocated memory is still 211.8 MB. Free memory was 170.9 MB in the beginning and 168.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 39.41 ms. Allocated memory is still 211.8 MB. Free memory was 168.3 MB in the beginning and 166.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1481.94 ms. Allocated memory was 211.8 MB in the beginning and 254.8 MB in the end (delta: 43.0 MB). Free memory was 166.2 MB in the beginning and 187.5 MB in the end (delta: -21.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 3745.69 ms. Allocated memory was 254.8 MB in the beginning and 338.7 MB in the end (delta: 83.9 MB). Free memory was 186.9 MB in the beginning and 220.6 MB in the end (delta: -33.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L720] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L721] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L722] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L723] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L724] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L725] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L729] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L730] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L731] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L732] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L733] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L734] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L735] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 0 pthread_t t1400; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t1400, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1401; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t1401, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1402; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t1402, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$w_buff1 = y$w_buff0 [L787] 3 y$w_buff0 = 1 [L788] 3 y$w_buff1_used = y$w_buff0_used [L789] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y [L765] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L769] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L770] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EAX = y [L773] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L773] 2 y = y$flush_delayed ? y$mem_tmp : y [L774] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L841] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2Thread1of1ForFork0 with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 12.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 555.5ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 175.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 49.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 7 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 11.0ms SsaConstructionTime, 72.5ms SatisfiabilityAnalysisTime, 129.2ms InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2 with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 13.6ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 9.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 2911.2ms, OverallIterations: 7, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1856.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 72 SDtfs, 182 SDslu, 261 SDs, 0 SdLazy, 273 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 256.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 722.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=597occurred in iteration=3, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 25.7ms SsaConstructionTime, 250.8ms SatisfiabilityAnalysisTime, 606.9ms InterpolantComputationTime, 529 NumberOfCodeBlocks, 529 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 442 ConstructedInterpolants, 0 QuantifiedInterpolants, 1868 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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! Received shutdown request...