/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-OGIterative-Hitting.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 10:12:54,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 10:12:54,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 10:12:54,772 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 10:12:54,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 10:12:54,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 10:12:54,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 10:12:54,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 10:12:54,786 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 10:12:54,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 10:12:54,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 10:12:54,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 10:12:54,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 10:12:54,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 10:12:54,796 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 10:12:54,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 10:12:54,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 10:12:54,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 10:12:54,803 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 10:12:54,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 10:12:54,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 10:12:54,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 10:12:54,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 10:12:54,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 10:12:54,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 10:12:54,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 10:12:54,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 10:12:54,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 10:12:54,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 10:12:54,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 10:12:54,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 10:12:54,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 10:12:54,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 10:12:54,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 10:12:54,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 10:12:54,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 10:12:54,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 10:12:54,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 10:12:54,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 10:12:54,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 10:12:54,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 10:12:54,842 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-OGIterative-Hitting.epf [2021-08-13 10:12:54,877 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 10:12:54,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 10:12:54,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 10:12:54,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 10:12:54,881 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 10:12:54,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 10:12:54,881 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 10:12:54,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 10:12:54,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 10:12:54,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 10:12:54,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 10:12:54,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 10:12:54,883 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 10:12:54,883 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 10:12:54,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 10:12:54,883 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 10:12:54,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 10:12:54,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 10:12:54,884 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 10:12:54,884 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 10:12:54,884 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 10:12:54,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 10:12:54,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 10:12:54,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 10:12:54,885 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 10:12:54,885 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 10:12:54,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 10:12:54,886 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 10:12:54,886 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 10:12:54,886 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 10:12:54,886 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 10:12:54,886 INFO L138 SettingsManager]: * Use hitting sets in computation of OwickiGries annotation=true [2021-08-13 10:12:54,886 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-08-13 10:12:55,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 10:12:55,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 10:12:55,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 10:12:55,262 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 10:12:55,263 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 10:12:55,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2021-08-13 10:12:55,321 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94deee38/05ce0b645b474a2f80f4784e52ecc7d3/FLAG52495ae97 [2021-08-13 10:12:55,833 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 10:12:55,834 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2021-08-13 10:12:55,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94deee38/05ce0b645b474a2f80f4784e52ecc7d3/FLAG52495ae97 [2021-08-13 10:12:56,150 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94deee38/05ce0b645b474a2f80f4784e52ecc7d3 [2021-08-13 10:12:56,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 10:12:56,154 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 10:12:56,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 10:12:56,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 10:12:56,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 10:12:56,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 10:12:56" (1/1) ... [2021-08-13 10:12:56,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f73c2a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:12:56, skipping insertion in model container [2021-08-13 10:12:56,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 10:12:56" (1/1) ... [2021-08-13 10:12:56,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 10:12:56,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 10:12:56,367 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/mix042_power.opt.i[950,963] [2021-08-13 10:12:56,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 10:12:56,679 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 10:12:56,689 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/mix042_power.opt.i[950,963] [2021-08-13 10:12:56,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 10:12:56,833 INFO L208 MainTranslator]: Completed translation [2021-08-13 10:12:56,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:12:56 WrapperNode [2021-08-13 10:12:56,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 10:12:56,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 10:12:56,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 10:12:56,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 10:12:56,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:12:56" (1/1) ... [2021-08-13 10:12:56,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:12:56" (1/1) ... [2021-08-13 10:12:56,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 10:12:56,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 10:12:56,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 10:12:56,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 10:12:56,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:12:56" (1/1) ... [2021-08-13 10:12:56,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:12:56" (1/1) ... [2021-08-13 10:12:56,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:12:56" (1/1) ... [2021-08-13 10:12:56,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:12:56" (1/1) ... [2021-08-13 10:12:56,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:12:56" (1/1) ... [2021-08-13 10:12:56,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:12:56" (1/1) ... [2021-08-13 10:12:56,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:12:56" (1/1) ... [2021-08-13 10:12:56,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 10:12:56,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 10:12:56,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 10:12:56,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 10:12:56,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:12:56" (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-08-13 10:12:57,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 10:12:57,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 10:12:57,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 10:12:57,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 10:12:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 10:12:57,065 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 10:12:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 10:12:57,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 10:12:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-13 10:12:57,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-13 10:12:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 10:12:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 10:12:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 10:12:57,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 10:12:57,068 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-13 10:12:58,657 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 10:12:58,657 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 10:12:58,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 10:12:58 BoogieIcfgContainer [2021-08-13 10:12:58,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 10:12:58,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 10:12:58,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 10:12:58,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 10:12:58,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 10:12:56" (1/3) ... [2021-08-13 10:12:58,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ede27fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 10:12:58, skipping insertion in model container [2021-08-13 10:12:58,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 10:12:56" (2/3) ... [2021-08-13 10:12:58,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ede27fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 10:12:58, skipping insertion in model container [2021-08-13 10:12:58,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 10:12:58" (3/3) ... [2021-08-13 10:12:58,669 INFO L111 eAbstractionObserver]: Analyzing ICFG mix042_power.opt.i [2021-08-13 10:12:58,677 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 10:12:58,677 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 10:12:58,678 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 10:12:58,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,706 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,706 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,707 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,707 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,708 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,708 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,709 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,709 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,713 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,713 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,713 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,713 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,713 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,714 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,714 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,714 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,715 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,720 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,720 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,727 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,728 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,729 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,731 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,734 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 10:12:58,736 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 10:12:58,755 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-13 10:12:58,772 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 10:12:58,772 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 10:12:58,772 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 10:12:58,772 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 10:12:58,772 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 10:12:58,772 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 10:12:58,773 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 10:12:58,773 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 10:12:58,786 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2021-08-13 10:12:58,843 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2021-08-13 10:12:58,844 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 10:12:58,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2021-08-13 10:12:58,848 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2021-08-13 10:12:58,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2021-08-13 10:12:58,873 INFO L129 PetriNetUnfolder]: 0/72 cut-off events. [2021-08-13 10:12:58,873 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 10:12:58,874 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:12:58,874 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:12:58,875 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:12:58,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:12:58,882 INFO L82 PathProgramCache]: Analyzing trace with hash -978306701, now seen corresponding path program 1 times [2021-08-13 10:12:58,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:12:58,889 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20510085] [2021-08-13 10:12:58,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:12:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:12:59,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:12:59,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:12:59,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:12:59,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:12:59,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:12:59,162 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:12:59,162 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20510085] [2021-08-13 10:12:59,163 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20510085] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:12:59,163 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:12:59,163 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 10:12:59,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411727232] [2021-08-13 10:12:59,171 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 10:12:59,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:12:59,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 10:12:59,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 10:12:59,185 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 110 [2021-08-13 10:12:59,190 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 107 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:12:59,190 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:12:59,191 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 110 [2021-08-13 10:12:59,192 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:12:59,308 INFO L129 PetriNetUnfolder]: 16/221 cut-off events. [2021-08-13 10:12:59,308 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 10:12:59,311 INFO L84 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 221 events. 16/221 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 663 event pairs, 6 based on Foata normal form. 9/219 useless extension candidates. Maximal degree in co-relation 216. Up to 27 conditions per place. [2021-08-13 10:12:59,313 INFO L132 encePairwiseOnDemand]: 105/110 looper letters, 7 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2021-08-13 10:12:59,314 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 106 transitions, 239 flow [2021-08-13 10:12:59,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 10:12:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 10:12:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2021-08-13 10:12:59,331 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9515151515151515 [2021-08-13 10:12:59,331 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2021-08-13 10:12:59,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2021-08-13 10:12:59,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:12:59,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2021-08-13 10:12:59,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:12:59,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:12:59,350 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:12:59,351 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 0 predicate places. [2021-08-13 10:12:59,351 INFO L482 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 239 flow [2021-08-13 10:12:59,351 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:12:59,351 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:12:59,352 INFO L266 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-08-13 10:12:59,352 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 10:12:59,352 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:12:59,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:12:59,353 INFO L82 PathProgramCache]: Analyzing trace with hash -779061261, now seen corresponding path program 1 times [2021-08-13 10:12:59,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:12:59,354 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353067655] [2021-08-13 10:12:59,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:12:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:12:59,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:12:59,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:12:59,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:12:59,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:12:59,538 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:12:59,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:12:59,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:12:59,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:12:59,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:12:59,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:12:59,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:12:59,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:12:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:12:59,575 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:12:59,575 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353067655] [2021-08-13 10:12:59,576 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353067655] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:12:59,576 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:12:59,576 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 10:12:59,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638229020] [2021-08-13 10:12:59,578 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 10:12:59,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:12:59,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 10:12:59,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 10:12:59,580 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 110 [2021-08-13 10:12:59,581 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:12:59,581 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:12:59,581 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 110 [2021-08-13 10:12:59,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:12:59,762 INFO L129 PetriNetUnfolder]: 30/319 cut-off events. [2021-08-13 10:12:59,762 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-08-13 10:12:59,764 INFO L84 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 319 events. 30/319 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1471 event pairs, 6 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 396. Up to 45 conditions per place. [2021-08-13 10:12:59,765 INFO L132 encePairwiseOnDemand]: 104/110 looper letters, 7 selfloop transitions, 2 changer transitions 13/118 dead transitions. [2021-08-13 10:12:59,765 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 118 transitions, 309 flow [2021-08-13 10:12:59,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 10:12:59,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 10:12:59,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 905 transitions. [2021-08-13 10:12:59,768 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9141414141414141 [2021-08-13 10:12:59,768 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 905 transitions. [2021-08-13 10:12:59,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 905 transitions. [2021-08-13 10:12:59,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:12:59,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 905 transitions. [2021-08-13 10:12:59,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.55555555555556) internal successors, (905), 9 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:12:59,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:12:59,774 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:12:59,775 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 8 predicate places. [2021-08-13 10:12:59,775 INFO L482 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 309 flow [2021-08-13 10:12:59,776 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:12:59,776 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:12:59,776 INFO L266 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] [2021-08-13 10:12:59,776 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 10:12:59,776 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:12:59,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:12:59,777 INFO L82 PathProgramCache]: Analyzing trace with hash -212336426, now seen corresponding path program 1 times [2021-08-13 10:12:59,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:12:59,777 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265271909] [2021-08-13 10:12:59,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:12:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:12:59,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:12:59,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:12:59,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:12:59,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:12:59,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:12:59,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 10:12:59,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:12:59,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 10:12:59,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:12:59,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 10:12:59,916 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-13 10:12:59,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 10:12:59,937 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:12:59,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:12:59,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:12:59,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:12:59,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:12:59,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:12:59,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:12:59,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:12:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:12:59,977 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:12:59,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265271909] [2021-08-13 10:12:59,978 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265271909] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:12:59,978 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:12:59,978 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 10:12:59,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282356209] [2021-08-13 10:12:59,979 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 10:12:59,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:12:59,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 10:12:59,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-13 10:12:59,983 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 110 [2021-08-13 10:12:59,984 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 118 transitions, 309 flow. Second operand has 10 states, 10 states have (on average 90.3) internal successors, (903), 10 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:12:59,984 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:12:59,984 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 110 [2021-08-13 10:12:59,984 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:13:00,492 INFO L129 PetriNetUnfolder]: 196/829 cut-off events. [2021-08-13 10:13:00,492 INFO L130 PetriNetUnfolder]: For 173/211 co-relation queries the response was YES. [2021-08-13 10:13:00,496 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 829 events. 196/829 cut-off events. For 173/211 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5655 event pairs, 32 based on Foata normal form. 2/821 useless extension candidates. Maximal degree in co-relation 1490. Up to 166 conditions per place. [2021-08-13 10:13:00,499 INFO L132 encePairwiseOnDemand]: 99/110 looper letters, 16 selfloop transitions, 8 changer transitions 81/182 dead transitions. [2021-08-13 10:13:00,500 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 182 transitions, 735 flow [2021-08-13 10:13:00,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 10:13:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 10:13:00,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1487 transitions. [2021-08-13 10:13:00,504 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8448863636363636 [2021-08-13 10:13:00,504 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1487 transitions. [2021-08-13 10:13:00,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1487 transitions. [2021-08-13 10:13:00,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:13:00,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1487 transitions. [2021-08-13 10:13:00,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 92.9375) internal successors, (1487), 16 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:00,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 110.0) internal successors, (1870), 17 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:00,514 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 110.0) internal successors, (1870), 17 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:00,514 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 23 predicate places. [2021-08-13 10:13:00,514 INFO L482 AbstractCegarLoop]: Abstraction has has 138 places, 182 transitions, 735 flow [2021-08-13 10:13:00,515 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 90.3) internal successors, (903), 10 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:00,515 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:13:00,515 INFO L266 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-08-13 10:13:00,515 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 10:13:00,515 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:13:00,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:13:00,516 INFO L82 PathProgramCache]: Analyzing trace with hash -466192105, now seen corresponding path program 1 times [2021-08-13 10:13:00,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:13:00,516 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152390011] [2021-08-13 10:13:00,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:13:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:13:00,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:00,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:00,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:00,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:00,665 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 10:13:00,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 10:13:00,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:00,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 10:13:00,693 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 10:13:00,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:00,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:00,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:13:00,706 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:13:00,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152390011] [2021-08-13 10:13:00,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152390011] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:13:00,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:13:00,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 10:13:00,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807331536] [2021-08-13 10:13:00,708 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 10:13:00,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:13:00,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 10:13:00,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 10:13:00,710 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2021-08-13 10:13:00,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 182 transitions, 735 flow. Second operand has 6 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:00,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:13:00,711 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2021-08-13 10:13:00,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:13:01,051 INFO L129 PetriNetUnfolder]: 444/1633 cut-off events. [2021-08-13 10:13:01,051 INFO L130 PetriNetUnfolder]: For 262/332 co-relation queries the response was YES. [2021-08-13 10:13:01,057 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3093 conditions, 1633 events. 444/1633 cut-off events. For 262/332 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 13522 event pairs, 58 based on Foata normal form. 0/1558 useless extension candidates. Maximal degree in co-relation 3030. Up to 350 conditions per place. [2021-08-13 10:13:01,063 INFO L132 encePairwiseOnDemand]: 100/110 looper letters, 21 selfloop transitions, 15 changer transitions 63/212 dead transitions. [2021-08-13 10:13:01,064 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 212 transitions, 877 flow [2021-08-13 10:13:01,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 10:13:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 10:13:01,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1003 transitions. [2021-08-13 10:13:01,067 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9118181818181819 [2021-08-13 10:13:01,067 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1003 transitions. [2021-08-13 10:13:01,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1003 transitions. [2021-08-13 10:13:01,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:13:01,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1003 transitions. [2021-08-13 10:13:01,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.3) internal successors, (1003), 10 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:01,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 110.0) internal successors, (1210), 11 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:01,073 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 110.0) internal successors, (1210), 11 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:01,073 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 32 predicate places. [2021-08-13 10:13:01,073 INFO L482 AbstractCegarLoop]: Abstraction has has 147 places, 212 transitions, 877 flow [2021-08-13 10:13:01,073 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:01,073 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:13:01,074 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:13:01,074 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 10:13:01,074 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:13:01,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:13:01,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1477621861, now seen corresponding path program 1 times [2021-08-13 10:13:01,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:13:01,075 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320453389] [2021-08-13 10:13:01,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:13:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:13:01,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:01,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:01,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:01,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:01,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:01,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:01,175 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 10:13:01,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 10:13:01,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:01,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 10:13:01,204 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 10:13:01,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:01,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:01,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:13:01,214 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:13:01,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320453389] [2021-08-13 10:13:01,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320453389] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:13:01,215 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:13:01,215 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 10:13:01,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993043615] [2021-08-13 10:13:01,215 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 10:13:01,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:13:01,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 10:13:01,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 10:13:01,217 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2021-08-13 10:13:01,218 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 212 transitions, 877 flow. Second operand has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:01,218 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:13:01,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2021-08-13 10:13:01,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:13:01,486 INFO L129 PetriNetUnfolder]: 203/704 cut-off events. [2021-08-13 10:13:01,486 INFO L130 PetriNetUnfolder]: For 99/804 co-relation queries the response was YES. [2021-08-13 10:13:01,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1625 conditions, 704 events. 203/704 cut-off events. For 99/804 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4285 event pairs, 7 based on Foata normal form. 73/734 useless extension candidates. Maximal degree in co-relation 1559. Up to 142 conditions per place. [2021-08-13 10:13:01,492 INFO L132 encePairwiseOnDemand]: 100/110 looper letters, 22 selfloop transitions, 36 changer transitions 42/198 dead transitions. [2021-08-13 10:13:01,492 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 198 transitions, 887 flow [2021-08-13 10:13:01,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 10:13:01,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 10:13:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1305 transitions. [2021-08-13 10:13:01,496 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9125874125874126 [2021-08-13 10:13:01,496 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1305 transitions. [2021-08-13 10:13:01,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1305 transitions. [2021-08-13 10:13:01,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:13:01,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1305 transitions. [2021-08-13 10:13:01,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 100.38461538461539) internal successors, (1305), 13 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:01,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 110.0) internal successors, (1540), 14 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:01,503 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 110.0) internal successors, (1540), 14 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:01,503 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 35 predicate places. [2021-08-13 10:13:01,503 INFO L482 AbstractCegarLoop]: Abstraction has has 150 places, 198 transitions, 887 flow [2021-08-13 10:13:01,503 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 97.14285714285714) internal successors, (680), 7 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:01,503 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:13:01,503 INFO L266 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-08-13 10:13:01,504 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 10:13:01,504 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:13:01,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:13:01,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1430138851, now seen corresponding path program 1 times [2021-08-13 10:13:01,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:13:01,504 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554135896] [2021-08-13 10:13:01,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:13:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:13:01,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:01,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:01,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:01,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:01,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:01,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:01,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:01,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:01,617 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 10:13:01,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 10:13:01,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:01,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 10:13:01,647 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 10:13:01,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:01,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:01,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:01,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:13:01,658 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:13:01,659 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554135896] [2021-08-13 10:13:01,659 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554135896] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:13:01,659 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:13:01,659 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 10:13:01,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818641669] [2021-08-13 10:13:01,660 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 10:13:01,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:13:01,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 10:13:01,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-13 10:13:01,662 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2021-08-13 10:13:01,663 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 198 transitions, 887 flow. Second operand has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:01,663 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:13:01,663 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2021-08-13 10:13:01,663 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:13:01,983 INFO L129 PetriNetUnfolder]: 163/513 cut-off events. [2021-08-13 10:13:01,983 INFO L130 PetriNetUnfolder]: For 182/1560 co-relation queries the response was YES. [2021-08-13 10:13:01,986 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 513 events. 163/513 cut-off events. For 182/1560 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2951 event pairs, 0 based on Foata normal form. 109/591 useless extension candidates. Maximal degree in co-relation 1477. Up to 131 conditions per place. [2021-08-13 10:13:01,988 INFO L132 encePairwiseOnDemand]: 100/110 looper letters, 19 selfloop transitions, 40 changer transitions 61/207 dead transitions. [2021-08-13 10:13:01,989 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 207 transitions, 1163 flow [2021-08-13 10:13:01,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 10:13:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 10:13:01,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1592 transitions. [2021-08-13 10:13:01,993 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9045454545454545 [2021-08-13 10:13:01,994 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1592 transitions. [2021-08-13 10:13:01,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1592 transitions. [2021-08-13 10:13:01,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:13:01,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1592 transitions. [2021-08-13 10:13:01,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 99.5) internal successors, (1592), 16 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:02,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 110.0) internal successors, (1870), 17 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:02,004 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 110.0) internal successors, (1870), 17 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:02,004 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 44 predicate places. [2021-08-13 10:13:02,004 INFO L482 AbstractCegarLoop]: Abstraction has has 159 places, 207 transitions, 1163 flow [2021-08-13 10:13:02,004 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:02,005 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:13:02,005 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:13:02,005 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 10:13:02,005 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:13:02,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:13:02,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1523074943, now seen corresponding path program 1 times [2021-08-13 10:13:02,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:13:02,006 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305239310] [2021-08-13 10:13:02,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:13:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:13:02,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:02,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:02,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:02,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:02,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:02,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:02,153 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:13:02,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:13:02,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:02,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:02,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:02,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:02,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:02,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:02,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:13:02,194 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:13:02,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305239310] [2021-08-13 10:13:02,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305239310] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:13:02,194 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:13:02,194 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 10:13:02,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911401386] [2021-08-13 10:13:02,195 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 10:13:02,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:13:02,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 10:13:02,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-13 10:13:02,197 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2021-08-13 10:13:02,198 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 207 transitions, 1163 flow. Second operand has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:02,198 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:13:02,198 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2021-08-13 10:13:02,198 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:13:02,373 INFO L129 PetriNetUnfolder]: 328/1039 cut-off events. [2021-08-13 10:13:02,373 INFO L130 PetriNetUnfolder]: For 442/1494 co-relation queries the response was YES. [2021-08-13 10:13:02,378 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3112 conditions, 1039 events. 328/1039 cut-off events. For 442/1494 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 8162 event pairs, 0 based on Foata normal form. 0/978 useless extension candidates. Maximal degree in co-relation 3039. Up to 265 conditions per place. [2021-08-13 10:13:02,382 INFO L132 encePairwiseOnDemand]: 104/110 looper letters, 9 selfloop transitions, 2 changer transitions 66/213 dead transitions. [2021-08-13 10:13:02,382 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 213 transitions, 1231 flow [2021-08-13 10:13:02,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-13 10:13:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-08-13 10:13:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 690 transitions. [2021-08-13 10:13:02,384 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8961038961038961 [2021-08-13 10:13:02,384 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 690 transitions. [2021-08-13 10:13:02,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 690 transitions. [2021-08-13 10:13:02,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:13:02,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 690 transitions. [2021-08-13 10:13:02,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:02,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:02,388 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:02,388 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 50 predicate places. [2021-08-13 10:13:02,388 INFO L482 AbstractCegarLoop]: Abstraction has has 165 places, 213 transitions, 1231 flow [2021-08-13 10:13:02,389 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:02,389 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:13:02,389 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:13:02,389 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 10:13:02,389 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:13:02,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:13:02,390 INFO L82 PathProgramCache]: Analyzing trace with hash 954052769, now seen corresponding path program 2 times [2021-08-13 10:13:02,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:13:02,390 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247594996] [2021-08-13 10:13:02,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:13:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 10:13:02,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:02,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:02,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:02,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:02,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:02,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 10:13:02,466 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 10:13:02,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 10:13:02,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:02,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:02,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:02,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 10:13:02,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 10:13:02,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 10:13:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 10:13:02,504 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 10:13:02,504 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247594996] [2021-08-13 10:13:02,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247594996] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 10:13:02,504 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 10:13:02,504 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 10:13:02,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843151613] [2021-08-13 10:13:02,505 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 10:13:02,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 10:13:02,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 10:13:02,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-13 10:13:02,506 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2021-08-13 10:13:02,507 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 213 transitions, 1231 flow. Second operand has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:02,507 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 10:13:02,507 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2021-08-13 10:13:02,507 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 10:13:02,803 INFO L129 PetriNetUnfolder]: 644/1941 cut-off events. [2021-08-13 10:13:02,803 INFO L130 PetriNetUnfolder]: For 756/2602 co-relation queries the response was YES. [2021-08-13 10:13:02,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5921 conditions, 1941 events. 644/1941 cut-off events. For 756/2602 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 17808 event pairs, 1 based on Foata normal form. 0/1782 useless extension candidates. Maximal degree in co-relation 5844. Up to 517 conditions per place. [2021-08-13 10:13:02,818 INFO L132 encePairwiseOnDemand]: 104/110 looper letters, 9 selfloop transitions, 2 changer transitions 80/224 dead transitions. [2021-08-13 10:13:02,818 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 224 transitions, 1371 flow [2021-08-13 10:13:02,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-13 10:13:02,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-08-13 10:13:02,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 690 transitions. [2021-08-13 10:13:02,820 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8961038961038961 [2021-08-13 10:13:02,821 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 690 transitions. [2021-08-13 10:13:02,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 690 transitions. [2021-08-13 10:13:02,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 10:13:02,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 690 transitions. [2021-08-13 10:13:02,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:02,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:02,824 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 110.0) internal successors, (880), 8 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:02,825 INFO L348 CegarLoopForPetriNet]: 115 programPoint places, 56 predicate places. [2021-08-13 10:13:02,825 INFO L482 AbstractCegarLoop]: Abstraction has has 171 places, 224 transitions, 1371 flow [2021-08-13 10:13:02,825 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 10:13:02,825 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 10:13:02,825 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 10:13:02,825 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 10:13:02,826 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 10:13:02,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 10:13:02,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1111625023, now seen corresponding path program 3 times [2021-08-13 10:13:02,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 10:13:02,826 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569442415] [2021-08-13 10:13:02,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 10:13:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 10:13:02,862 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 10:13:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 10:13:02,905 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 10:13:02,940 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 10:13:02,941 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 10:13:02,941 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-13 10:13:02,943 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 10:13:03,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 10:13:03 BasicIcfg [2021-08-13 10:13:03,078 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 10:13:03,079 INFO L168 Benchmark]: Toolchain (without parser) took 6924.12 ms. Allocated memory was 194.0 MB in the beginning and 356.5 MB in the end (delta: 162.5 MB). Free memory was 157.5 MB in the beginning and 164.4 MB in the end (delta: -6.9 MB). Peak memory consumption was 157.1 MB. Max. memory is 8.0 GB. [2021-08-13 10:13:03,079 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 194.0 MB. Free memory was 175.9 MB in the beginning and 175.8 MB in the end (delta: 131.9 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 10:13:03,079 INFO L168 Benchmark]: CACSL2BoogieTranslator took 677.73 ms. Allocated memory is still 194.0 MB. Free memory was 157.2 MB in the beginning and 153.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 8.0 GB. [2021-08-13 10:13:03,079 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.59 ms. Allocated memory is still 194.0 MB. Free memory was 153.7 MB in the beginning and 150.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-13 10:13:03,080 INFO L168 Benchmark]: Boogie Preprocessor took 61.61 ms. Allocated memory is still 194.0 MB. Free memory was 150.6 MB in the beginning and 148.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 10:13:03,080 INFO L168 Benchmark]: RCFGBuilder took 1679.28 ms. Allocated memory was 194.0 MB in the beginning and 243.3 MB in the end (delta: 49.3 MB). Free memory was 148.5 MB in the beginning and 190.6 MB in the end (delta: -42.2 MB). Peak memory consumption was 84.2 MB. Max. memory is 8.0 GB. [2021-08-13 10:13:03,082 INFO L168 Benchmark]: TraceAbstraction took 4417.05 ms. Allocated memory was 243.3 MB in the beginning and 356.5 MB in the end (delta: 113.2 MB). Free memory was 190.1 MB in the beginning and 164.4 MB in the end (delta: 25.7 MB). Peak memory consumption was 138.9 MB. Max. memory is 8.0 GB. [2021-08-13 10:13:03,092 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.13 ms. Allocated memory is still 194.0 MB. Free memory was 175.9 MB in the beginning and 175.8 MB in the end (delta: 131.9 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 677.73 ms. Allocated memory is still 194.0 MB. Free memory was 157.2 MB in the beginning and 153.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 81.59 ms. Allocated memory is still 194.0 MB. Free memory was 153.7 MB in the beginning and 150.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 61.61 ms. Allocated memory is still 194.0 MB. Free memory was 150.6 MB in the beginning and 148.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1679.28 ms. Allocated memory was 194.0 MB in the beginning and 243.3 MB in the end (delta: 49.3 MB). Free memory was 148.5 MB in the beginning and 190.6 MB in the end (delta: -42.2 MB). Peak memory consumption was 84.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4417.05 ms. Allocated memory was 243.3 MB in the beginning and 356.5 MB in the end (delta: 113.2 MB). Free memory was 190.1 MB in the beginning and 164.4 MB in the end (delta: 25.7 MB). Peak memory consumption was 138.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L725] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L726] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L727] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L728] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L729] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L734] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L735] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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}] [L736] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L737] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L738] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L739] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L741] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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] [L743] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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 t1108; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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 t1109; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L829] 0 pthread_t t1110; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L830] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 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) [L803] 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) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L805] 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 [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L807] 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 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, 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_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L836] 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) [L836] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L836] 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) [L836] 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) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 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 [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L840] 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 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L847] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L848] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L848] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L849] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L849] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L850] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L850] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L851] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L852] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, 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_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, 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_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 20.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 4173.0ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2409.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 79.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 68 SDtfs, 250 SDslu, 216 SDs, 0 SdLazy, 369 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 400.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 916.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1371occurred in iteration=8, InterpolantAutomatonStates: 81, 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: 38.3ms SsaConstructionTime, 403.8ms SatisfiabilityAnalysisTime, 963.7ms InterpolantComputationTime, 694 NumberOfCodeBlocks, 694 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 600 ConstructedInterpolants, 0 QuantifiedInterpolants, 1876 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...