/usr/bin/java -Xmx16000000000 -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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-24 19:40:31,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-24 19:40:31,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-24 19:40:31,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-24 19:40:31,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-24 19:40:31,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-24 19:40:31,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-24 19:40:31,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-24 19:40:31,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-24 19:40:31,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-24 19:40:31,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-24 19:40:31,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-24 19:40:31,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-24 19:40:31,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-24 19:40:31,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-24 19:40:31,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-24 19:40:31,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-24 19:40:31,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-24 19:40:31,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-24 19:40:31,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-24 19:40:31,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-24 19:40:31,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-24 19:40:31,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-24 19:40:31,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-24 19:40:31,199 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-24 19:40:31,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-24 19:40:31,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-24 19:40:31,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-24 19:40:31,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-24 19:40:31,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-24 19:40:31,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-24 19:40:31,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-24 19:40:31,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-24 19:40:31,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-24 19:40:31,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-24 19:40:31,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-24 19:40:31,206 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-24 19:40:31,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-24 19:40:31,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-24 19:40:31,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-24 19:40:31,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-24 19:40:31,211 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-SemanticLbe.epf [2021-03-24 19:40:31,245 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-24 19:40:31,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-24 19:40:31,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-24 19:40:31,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-24 19:40:31,249 INFO L138 SettingsManager]: * Use SBE=true [2021-03-24 19:40:31,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-24 19:40:31,250 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-24 19:40:31,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-24 19:40:31,250 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-24 19:40:31,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-24 19:40:31,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-24 19:40:31,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-24 19:40:31,251 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-24 19:40:31,251 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-24 19:40:31,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-24 19:40:31,252 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-24 19:40:31,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-24 19:40:31,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-24 19:40:31,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-24 19:40:31,252 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-24 19:40:31,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-24 19:40:31,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-24 19:40:31,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-24 19:40:31,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-24 19:40:31,253 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-24 19:40:31,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-24 19:40:31,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-24 19:40:31,253 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-24 19:40:31,253 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-03-24 19:40:31,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-24 19:40:31,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-24 19:40:31,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-24 19:40:31,571 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-24 19:40:31,572 INFO L275 PluginConnector]: CDTParser initialized [2021-03-24 19:40:31,573 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2021-03-24 19:40:31,634 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df2bcdb6/252269f6baa74dfc8859fd1db6830ab8/FLAGd1e2d7721 [2021-03-24 19:40:32,204 INFO L306 CDTParser]: Found 1 translation units. [2021-03-24 19:40:32,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2021-03-24 19:40:32,216 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df2bcdb6/252269f6baa74dfc8859fd1db6830ab8/FLAGd1e2d7721 [2021-03-24 19:40:32,474 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df2bcdb6/252269f6baa74dfc8859fd1db6830ab8 [2021-03-24 19:40:32,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-24 19:40:32,478 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-24 19:40:32,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-24 19:40:32,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-24 19:40:32,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-24 19:40:32,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 07:40:32" (1/1) ... [2021-03-24 19:40:32,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aae8ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:40:32, skipping insertion in model container [2021-03-24 19:40:32,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 07:40:32" (1/1) ... [2021-03-24 19:40:32,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-24 19:40:32,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-24 19:40:32,684 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i[949,962] [2021-03-24 19:40:32,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 19:40:32,868 INFO L203 MainTranslator]: Completed pre-run [2021-03-24 19:40:32,879 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i[949,962] [2021-03-24 19:40:32,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 19:40:33,012 INFO L208 MainTranslator]: Completed translation [2021-03-24 19:40:33,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:40:33 WrapperNode [2021-03-24 19:40:33,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-24 19:40:33,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-24 19:40:33,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-24 19:40:33,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-24 19:40:33,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:40:33" (1/1) ... [2021-03-24 19:40:33,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:40:33" (1/1) ... [2021-03-24 19:40:33,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-24 19:40:33,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-24 19:40:33,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-24 19:40:33,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-24 19:40:33,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:40:33" (1/1) ... [2021-03-24 19:40:33,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:40:33" (1/1) ... [2021-03-24 19:40:33,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:40:33" (1/1) ... [2021-03-24 19:40:33,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:40:33" (1/1) ... [2021-03-24 19:40:33,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:40:33" (1/1) ... [2021-03-24 19:40:33,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:40:33" (1/1) ... [2021-03-24 19:40:33,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:40:33" (1/1) ... [2021-03-24 19:40:33,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-24 19:40:33,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-24 19:40:33,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-24 19:40:33,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-24 19:40:33,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:40:33" (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-03-24 19:40:33,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-24 19:40:33,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-24 19:40:33,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-24 19:40:33,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-24 19:40:33,177 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-24 19:40:33,177 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-24 19:40:33,177 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-24 19:40:33,177 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-24 19:40:33,177 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-24 19:40:33,177 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-24 19:40:33,177 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-24 19:40:33,177 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-24 19:40:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-24 19:40:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-24 19:40:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-24 19:40:33,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-24 19:40:33,179 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-24 19:40:35,099 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-24 19:40:35,099 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-24 19:40:35,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 07:40:35 BoogieIcfgContainer [2021-03-24 19:40:35,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-24 19:40:35,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-24 19:40:35,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-24 19:40:35,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-24 19:40:35,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.03 07:40:32" (1/3) ... [2021-03-24 19:40:35,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3072ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 07:40:35, skipping insertion in model container [2021-03-24 19:40:35,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:40:33" (2/3) ... [2021-03-24 19:40:35,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3072ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 07:40:35, skipping insertion in model container [2021-03-24 19:40:35,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 07:40:35" (3/3) ... [2021-03-24 19:40:35,108 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2021-03-24 19:40:35,113 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-24 19:40:35,117 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-24 19:40:35,118 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-24 19:40:35,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,158 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,158 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,159 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,159 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,163 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,164 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,164 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,164 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,165 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,165 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,165 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,165 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,166 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,166 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,169 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,169 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,169 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,169 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,169 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,169 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,169 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,170 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,170 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,170 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,170 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,171 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,172 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,172 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,172 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,175 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,175 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,175 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,175 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,176 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,176 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,176 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,176 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,177 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,180 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,180 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,180 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,180 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,185 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,185 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,186 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,186 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,186 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,187 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,187 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,187 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,188 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,189 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,190 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,192 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,192 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,192 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,192 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,192 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,192 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,192 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,193 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,193 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,193 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,194 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,194 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,194 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,194 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,194 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,195 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,195 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,195 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,195 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,195 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,196 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,196 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,197 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:40:35,199 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-24 19:40:35,214 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-24 19:40:35,231 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-24 19:40:35,232 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-24 19:40:35,232 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-24 19:40:35,232 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-24 19:40:35,232 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-24 19:40:35,232 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-24 19:40:35,232 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-24 19:40:35,232 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-24 19:40:35,242 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 119 transitions, 258 flow [2021-03-24 19:40:35,278 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-03-24 19:40:35,278 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:40:35,283 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-24 19:40:35,283 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 119 transitions, 258 flow [2021-03-24 19:40:35,287 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 115 transitions, 242 flow [2021-03-24 19:40:35,288 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-24 19:40:35,299 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 242 flow [2021-03-24 19:40:35,302 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 115 transitions, 242 flow [2021-03-24 19:40:35,303 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 242 flow [2021-03-24 19:40:35,322 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-03-24 19:40:35,322 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:40:35,323 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-24 19:40:35,326 INFO L142 LiptonReduction]: Number of co-enabled transitions 2868 [2021-03-24 19:40:36,689 WARN L205 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-03-24 19:40:37,257 WARN L205 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-03-24 19:40:38,567 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-24 19:40:39,157 WARN L205 SmtUtils]: Spent 588.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-24 19:40:40,099 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-24 19:40:40,427 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-24 19:40:40,546 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-24 19:40:42,317 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-24 19:40:42,609 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-24 19:40:43,288 WARN L205 SmtUtils]: Spent 671.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-24 19:40:43,901 WARN L205 SmtUtils]: Spent 611.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-24 19:40:44,068 INFO L154 LiptonReduction]: Checked pairs total: 5220 [2021-03-24 19:40:44,069 INFO L156 LiptonReduction]: Total number of compositions: 76 [2021-03-24 19:40:44,070 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8783 [2021-03-24 19:40:44,080 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-24 19:40:44,080 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:40:44,080 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:44,081 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 19:40:44,081 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:44,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:44,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1034007324, now seen corresponding path program 1 times [2021-03-24 19:40:44,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:44,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229368380] [2021-03-24 19:40:44,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:44,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:44,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:44,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:44,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:44,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:40:44,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229368380] [2021-03-24 19:40:44,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:44,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-24 19:40:44,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679767205] [2021-03-24 19:40:44,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-24 19:40:44,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:44,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-24 19:40:44,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-24 19:40:44,378 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 195 [2021-03-24 19:40:44,382 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:44,382 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:44,382 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 195 [2021-03-24 19:40:44,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:44,517 INFO L129 PetriNetUnfolder]: 185/412 cut-off events. [2021-03-24 19:40:44,517 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:40:44,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 412 events. 185/412 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2212 event pairs, 123 based on Foata normal form. 20/393 useless extension candidates. Maximal degree in co-relation 685. Up to 209 conditions per place. [2021-03-24 19:40:44,521 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 11 selfloop transitions, 2 changer transitions 4/50 dead transitions. [2021-03-24 19:40:44,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 142 flow [2021-03-24 19:40:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-24 19:40:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-24 19:40:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2021-03-24 19:40:44,546 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9179487179487179 [2021-03-24 19:40:44,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 537 transitions. [2021-03-24 19:40:44,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 537 transitions. [2021-03-24 19:40:44,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:44,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 537 transitions. [2021-03-24 19:40:44,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:44,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:44,568 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:44,570 INFO L185 Difference]: Start difference. First operand has 59 places, 47 transitions, 106 flow. Second operand 3 states and 537 transitions. [2021-03-24 19:40:44,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 142 flow [2021-03-24 19:40:44,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-24 19:40:44,576 INFO L241 Difference]: Finished difference. Result has 55 places, 41 transitions, 94 flow [2021-03-24 19:40:44,577 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2021-03-24 19:40:44,578 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2021-03-24 19:40:44,578 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 94 flow [2021-03-24 19:40:44,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:44,579 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:44,579 INFO L263 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] [2021-03-24 19:40:44,579 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-24 19:40:44,579 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:44,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:44,580 INFO L82 PathProgramCache]: Analyzing trace with hash 48708481, now seen corresponding path program 1 times [2021-03-24 19:40:44,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:44,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159518692] [2021-03-24 19:40:44,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:44,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:44,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:44,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:44,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:44,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:44,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:40:44,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:40:44,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159518692] [2021-03-24 19:40:44,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:44,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 19:40:44,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596195533] [2021-03-24 19:40:44,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 19:40:44,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:44,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 19:40:44,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 19:40:44,755 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 195 [2021-03-24 19:40:44,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:44,756 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:44,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 195 [2021-03-24 19:40:44,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:44,817 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2021-03-24 19:40:44,817 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:40:44,817 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 2/48 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-24 19:40:44,817 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 2 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2021-03-24 19:40:44,818 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 110 flow [2021-03-24 19:40:44,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 19:40:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 19:40:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 888 transitions. [2021-03-24 19:40:44,821 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9107692307692308 [2021-03-24 19:40:44,821 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 888 transitions. [2021-03-24 19:40:44,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 888 transitions. [2021-03-24 19:40:44,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:44,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 888 transitions. [2021-03-24 19:40:44,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 177.6) internal successors, (888), 5 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:44,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:44,828 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:44,828 INFO L185 Difference]: Start difference. First operand has 55 places, 41 transitions, 94 flow. Second operand 5 states and 888 transitions. [2021-03-24 19:40:44,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 110 flow [2021-03-24 19:40:44,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-24 19:40:44,830 INFO L241 Difference]: Finished difference. Result has 57 places, 41 transitions, 102 flow [2021-03-24 19:40:44,830 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2021-03-24 19:40:44,830 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2021-03-24 19:40:44,830 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 102 flow [2021-03-24 19:40:44,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:44,831 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:44,831 INFO L263 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] [2021-03-24 19:40:44,831 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-24 19:40:44,831 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:44,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:44,831 INFO L82 PathProgramCache]: Analyzing trace with hash -434886084, now seen corresponding path program 1 times [2021-03-24 19:40:44,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:44,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432399424] [2021-03-24 19:40:44,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:44,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:44,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:44,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:44,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:44,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:44,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:40:44,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:44,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:40:44,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:44,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 19:40:44,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:44,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:40:44,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:44,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:40:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:40:44,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432399424] [2021-03-24 19:40:44,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:44,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-24 19:40:44,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790450933] [2021-03-24 19:40:44,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-24 19:40:44,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:44,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-24 19:40:44,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-24 19:40:44,991 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 195 [2021-03-24 19:40:44,992 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 102 flow. Second operand has 7 states, 7 states have (on average 158.0) internal successors, (1106), 7 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:44,992 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:44,992 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 195 [2021-03-24 19:40:44,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:45,244 INFO L129 PetriNetUnfolder]: 335/610 cut-off events. [2021-03-24 19:40:45,244 INFO L130 PetriNetUnfolder]: For 152/152 co-relation queries the response was YES. [2021-03-24 19:40:45,247 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 610 events. 335/610 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3147 event pairs, 229 based on Foata normal form. 36/625 useless extension candidates. Maximal degree in co-relation 1219. Up to 421 conditions per place. [2021-03-24 19:40:45,251 INFO L132 encePairwiseOnDemand]: 184/195 looper letters, 11 selfloop transitions, 12 changer transitions 16/67 dead transitions. [2021-03-24 19:40:45,252 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 67 transitions, 236 flow [2021-03-24 19:40:45,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-24 19:40:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-24 19:40:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1455 transitions. [2021-03-24 19:40:45,257 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8290598290598291 [2021-03-24 19:40:45,257 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1455 transitions. [2021-03-24 19:40:45,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1455 transitions. [2021-03-24 19:40:45,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:45,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1455 transitions. [2021-03-24 19:40:45,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 161.66666666666666) internal successors, (1455), 9 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:45,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:45,265 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:45,265 INFO L185 Difference]: Start difference. First operand has 57 places, 41 transitions, 102 flow. Second operand 9 states and 1455 transitions. [2021-03-24 19:40:45,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 67 transitions, 236 flow [2021-03-24 19:40:45,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 67 transitions, 228 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-24 19:40:45,270 INFO L241 Difference]: Finished difference. Result has 64 places, 49 transitions, 170 flow [2021-03-24 19:40:45,270 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=170, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2021-03-24 19:40:45,271 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 5 predicate places. [2021-03-24 19:40:45,271 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 170 flow [2021-03-24 19:40:45,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 158.0) internal successors, (1106), 7 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:45,271 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:45,272 INFO L263 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] [2021-03-24 19:40:45,272 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-24 19:40:45,272 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:45,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:45,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1144036550, now seen corresponding path program 1 times [2021-03-24 19:40:45,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:45,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502845176] [2021-03-24 19:40:45,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:45,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:45,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:45,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:45,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:45,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:45,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:40:45,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:45,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 19:40:45,437 INFO L142 QuantifierPusher]: treesize reduction 17, result has 45.2 percent of original size [2021-03-24 19:40:45,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-24 19:40:45,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:45,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:40:45,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:40:45,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502845176] [2021-03-24 19:40:45,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:45,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-24 19:40:45,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333163270] [2021-03-24 19:40:45,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-24 19:40:45,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:45,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-24 19:40:45,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-24 19:40:45,461 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 195 [2021-03-24 19:40:45,463 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 170 flow. Second operand has 7 states, 7 states have (on average 160.0) internal successors, (1120), 7 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:45,463 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:45,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 195 [2021-03-24 19:40:45,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:45,698 INFO L129 PetriNetUnfolder]: 324/597 cut-off events. [2021-03-24 19:40:45,698 INFO L130 PetriNetUnfolder]: For 765/879 co-relation queries the response was YES. [2021-03-24 19:40:45,700 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 597 events. 324/597 cut-off events. For 765/879 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2963 event pairs, 108 based on Foata normal form. 39/620 useless extension candidates. Maximal degree in co-relation 1736. Up to 323 conditions per place. [2021-03-24 19:40:45,706 INFO L132 encePairwiseOnDemand]: 185/195 looper letters, 26 selfloop transitions, 12 changer transitions 10/77 dead transitions. [2021-03-24 19:40:45,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 77 transitions, 396 flow [2021-03-24 19:40:45,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-24 19:40:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-24 19:40:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1314 transitions. [2021-03-24 19:40:45,709 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8423076923076923 [2021-03-24 19:40:45,709 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1314 transitions. [2021-03-24 19:40:45,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1314 transitions. [2021-03-24 19:40:45,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:45,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1314 transitions. [2021-03-24 19:40:45,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 164.25) internal successors, (1314), 8 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:45,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:45,717 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:45,717 INFO L185 Difference]: Start difference. First operand has 64 places, 49 transitions, 170 flow. Second operand 8 states and 1314 transitions. [2021-03-24 19:40:45,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 77 transitions, 396 flow [2021-03-24 19:40:45,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 77 transitions, 384 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-24 19:40:45,723 INFO L241 Difference]: Finished difference. Result has 70 places, 56 transitions, 251 flow [2021-03-24 19:40:45,723 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=251, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2021-03-24 19:40:45,724 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 11 predicate places. [2021-03-24 19:40:45,724 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 251 flow [2021-03-24 19:40:45,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 160.0) internal successors, (1120), 7 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:45,724 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:45,724 INFO L263 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] [2021-03-24 19:40:45,725 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-24 19:40:45,725 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:45,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:45,725 INFO L82 PathProgramCache]: Analyzing trace with hash 729250821, now seen corresponding path program 1 times [2021-03-24 19:40:45,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:45,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204790390] [2021-03-24 19:40:45,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:45,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:45,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:45,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:45,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:45,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:45,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:40:45,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:45,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:40:45,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:45,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 19:40:45,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:45,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-24 19:40:45,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:45,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:40:45,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:45,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:40:45,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:45,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:40:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:40:45,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204790390] [2021-03-24 19:40:45,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:45,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-24 19:40:45,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202748820] [2021-03-24 19:40:45,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-24 19:40:45,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:45,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-24 19:40:45,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-03-24 19:40:45,923 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 195 [2021-03-24 19:40:45,924 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 251 flow. Second operand has 8 states, 8 states have (on average 157.125) internal successors, (1257), 8 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:45,924 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:45,924 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 195 [2021-03-24 19:40:45,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:46,198 INFO L129 PetriNetUnfolder]: 293/545 cut-off events. [2021-03-24 19:40:46,198 INFO L130 PetriNetUnfolder]: For 1333/1588 co-relation queries the response was YES. [2021-03-24 19:40:46,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2088 conditions, 545 events. 293/545 cut-off events. For 1333/1588 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2643 event pairs, 117 based on Foata normal form. 49/575 useless extension candidates. Maximal degree in co-relation 2049. Up to 365 conditions per place. [2021-03-24 19:40:46,203 INFO L132 encePairwiseOnDemand]: 183/195 looper letters, 20 selfloop transitions, 17 changer transitions 20/84 dead transitions. [2021-03-24 19:40:46,203 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 84 transitions, 554 flow [2021-03-24 19:40:46,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-24 19:40:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-24 19:40:46,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1603 transitions. [2021-03-24 19:40:46,207 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8220512820512821 [2021-03-24 19:40:46,207 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1603 transitions. [2021-03-24 19:40:46,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1603 transitions. [2021-03-24 19:40:46,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:46,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1603 transitions. [2021-03-24 19:40:46,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 160.3) internal successors, (1603), 10 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:46,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 195.0) internal successors, (2145), 11 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:46,214 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 195.0) internal successors, (2145), 11 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:46,214 INFO L185 Difference]: Start difference. First operand has 70 places, 56 transitions, 251 flow. Second operand 10 states and 1603 transitions. [2021-03-24 19:40:46,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 84 transitions, 554 flow [2021-03-24 19:40:46,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 84 transitions, 512 flow, removed 16 selfloop flow, removed 4 redundant places. [2021-03-24 19:40:46,219 INFO L241 Difference]: Finished difference. Result has 78 places, 60 transitions, 327 flow [2021-03-24 19:40:46,219 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=327, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2021-03-24 19:40:46,219 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 19 predicate places. [2021-03-24 19:40:46,219 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 327 flow [2021-03-24 19:40:46,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 157.125) internal successors, (1257), 8 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:46,220 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:46,220 INFO L263 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] [2021-03-24 19:40:46,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-24 19:40:46,220 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:46,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:46,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1572247898, now seen corresponding path program 1 times [2021-03-24 19:40:46,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:46,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863667027] [2021-03-24 19:40:46,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:46,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:46,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:46,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:46,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:46,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:46,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:40:46,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:46,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:40:46,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:46,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:40:46,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:46,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:40:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:40:46,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863667027] [2021-03-24 19:40:46,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:46,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 19:40:46,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001525116] [2021-03-24 19:40:46,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 19:40:46,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:46,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 19:40:46,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-24 19:40:46,363 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 195 [2021-03-24 19:40:46,363 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 60 transitions, 327 flow. Second operand has 6 states, 6 states have (on average 163.33333333333334) internal successors, (980), 6 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:46,363 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:46,364 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 195 [2021-03-24 19:40:46,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:46,616 INFO L129 PetriNetUnfolder]: 364/669 cut-off events. [2021-03-24 19:40:46,616 INFO L130 PetriNetUnfolder]: For 2548/3051 co-relation queries the response was YES. [2021-03-24 19:40:46,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 669 events. 364/669 cut-off events. For 2548/3051 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3309 event pairs, 107 based on Foata normal form. 42/690 useless extension candidates. Maximal degree in co-relation 3035. Up to 445 conditions per place. [2021-03-24 19:40:46,624 INFO L132 encePairwiseOnDemand]: 185/195 looper letters, 22 selfloop transitions, 21 changer transitions 9/81 dead transitions. [2021-03-24 19:40:46,624 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 81 transitions, 619 flow [2021-03-24 19:40:46,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 19:40:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 19:40:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1170 transitions. [2021-03-24 19:40:46,627 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2021-03-24 19:40:46,627 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1170 transitions. [2021-03-24 19:40:46,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1170 transitions. [2021-03-24 19:40:46,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:46,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1170 transitions. [2021-03-24 19:40:46,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 167.14285714285714) internal successors, (1170), 7 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:46,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:46,632 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:46,632 INFO L185 Difference]: Start difference. First operand has 78 places, 60 transitions, 327 flow. Second operand 7 states and 1170 transitions. [2021-03-24 19:40:46,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 81 transitions, 619 flow [2021-03-24 19:40:46,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 81 transitions, 575 flow, removed 11 selfloop flow, removed 8 redundant places. [2021-03-24 19:40:46,641 INFO L241 Difference]: Finished difference. Result has 77 places, 70 transitions, 460 flow [2021-03-24 19:40:46,642 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=460, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2021-03-24 19:40:46,642 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 18 predicate places. [2021-03-24 19:40:46,642 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 460 flow [2021-03-24 19:40:46,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.33333333333334) internal successors, (980), 6 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:46,642 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:46,642 INFO L263 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] [2021-03-24 19:40:46,643 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-24 19:40:46,643 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:46,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:46,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1502631598, now seen corresponding path program 2 times [2021-03-24 19:40:46,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:46,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937095676] [2021-03-24 19:40:46,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:46,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:46,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:46,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:46,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:46,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:46,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:40:46,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:46,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:40:46,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:46,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-24 19:40:46,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:46,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-24 19:40:46,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:46,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-24 19:40:46,807 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-03-24 19:40:46,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-24 19:40:46,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:46,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:40:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:40:46,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937095676] [2021-03-24 19:40:46,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:46,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-24 19:40:46,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130264014] [2021-03-24 19:40:46,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-24 19:40:46,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:46,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-24 19:40:46,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-03-24 19:40:46,849 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 195 [2021-03-24 19:40:46,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 460 flow. Second operand has 10 states, 10 states have (on average 155.0) internal successors, (1550), 10 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:46,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:46,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 195 [2021-03-24 19:40:46,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:47,219 INFO L129 PetriNetUnfolder]: 400/724 cut-off events. [2021-03-24 19:40:47,219 INFO L130 PetriNetUnfolder]: For 3829/4705 co-relation queries the response was YES. [2021-03-24 19:40:47,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3970 conditions, 724 events. 400/724 cut-off events. For 3829/4705 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3593 event pairs, 57 based on Foata normal form. 88/795 useless extension candidates. Maximal degree in co-relation 3925. Up to 448 conditions per place. [2021-03-24 19:40:47,228 INFO L132 encePairwiseOnDemand]: 182/195 looper letters, 33 selfloop transitions, 22 changer transitions 9/91 dead transitions. [2021-03-24 19:40:47,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 91 transitions, 804 flow [2021-03-24 19:40:47,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-24 19:40:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-24 19:40:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1738 transitions. [2021-03-24 19:40:47,233 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8102564102564103 [2021-03-24 19:40:47,233 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1738 transitions. [2021-03-24 19:40:47,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1738 transitions. [2021-03-24 19:40:47,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:47,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1738 transitions. [2021-03-24 19:40:47,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 158.0) internal successors, (1738), 11 states have internal predecessors, (1738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:47,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 195.0) internal successors, (2340), 12 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:47,242 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 195.0) internal successors, (2340), 12 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:47,242 INFO L185 Difference]: Start difference. First operand has 77 places, 70 transitions, 460 flow. Second operand 11 states and 1738 transitions. [2021-03-24 19:40:47,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 91 transitions, 804 flow [2021-03-24 19:40:47,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 91 transitions, 747 flow, removed 28 selfloop flow, removed 4 redundant places. [2021-03-24 19:40:47,254 INFO L241 Difference]: Finished difference. Result has 84 places, 74 transitions, 525 flow [2021-03-24 19:40:47,255 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=525, PETRI_PLACES=84, PETRI_TRANSITIONS=74} [2021-03-24 19:40:47,255 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 25 predicate places. [2021-03-24 19:40:47,255 INFO L480 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 525 flow [2021-03-24 19:40:47,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 155.0) internal successors, (1550), 10 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:47,256 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:47,256 INFO L263 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] [2021-03-24 19:40:47,256 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-24 19:40:47,257 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:47,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:47,257 INFO L82 PathProgramCache]: Analyzing trace with hash -2018017968, now seen corresponding path program 3 times [2021-03-24 19:40:47,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:47,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841719783] [2021-03-24 19:40:47,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:47,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:47,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:47,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:47,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:47,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:47,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:40:47,359 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-03-24 19:40:47,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-24 19:40:47,381 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-24 19:40:47,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-24 19:40:47,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:47,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:40:47,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:47,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:40:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:40:47,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841719783] [2021-03-24 19:40:47,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:47,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-24 19:40:47,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414782432] [2021-03-24 19:40:47,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-24 19:40:47,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:47,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-24 19:40:47,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-24 19:40:47,416 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 195 [2021-03-24 19:40:47,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 74 transitions, 525 flow. Second operand has 7 states, 7 states have (on average 159.28571428571428) internal successors, (1115), 7 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:47,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:47,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 195 [2021-03-24 19:40:47,417 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:47,746 INFO L129 PetriNetUnfolder]: 401/747 cut-off events. [2021-03-24 19:40:47,746 INFO L130 PetriNetUnfolder]: For 4145/5060 co-relation queries the response was YES. [2021-03-24 19:40:47,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4409 conditions, 747 events. 401/747 cut-off events. For 4145/5060 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3858 event pairs, 41 based on Foata normal form. 79/809 useless extension candidates. Maximal degree in co-relation 4361. Up to 410 conditions per place. [2021-03-24 19:40:47,756 INFO L132 encePairwiseOnDemand]: 184/195 looper letters, 30 selfloop transitions, 28 changer transitions 10/96 dead transitions. [2021-03-24 19:40:47,756 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 96 transitions, 949 flow [2021-03-24 19:40:47,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-24 19:40:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-24 19:40:47,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1619 transitions. [2021-03-24 19:40:47,760 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8302564102564103 [2021-03-24 19:40:47,760 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1619 transitions. [2021-03-24 19:40:47,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1619 transitions. [2021-03-24 19:40:47,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:47,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1619 transitions. [2021-03-24 19:40:47,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 161.9) internal successors, (1619), 10 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:47,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 195.0) internal successors, (2145), 11 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:47,768 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 195.0) internal successors, (2145), 11 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:47,768 INFO L185 Difference]: Start difference. First operand has 84 places, 74 transitions, 525 flow. Second operand 10 states and 1619 transitions. [2021-03-24 19:40:47,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 96 transitions, 949 flow [2021-03-24 19:40:47,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 96 transitions, 884 flow, removed 13 selfloop flow, removed 9 redundant places. [2021-03-24 19:40:47,777 INFO L241 Difference]: Finished difference. Result has 85 places, 77 transitions, 610 flow [2021-03-24 19:40:47,778 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=610, PETRI_PLACES=85, PETRI_TRANSITIONS=77} [2021-03-24 19:40:47,778 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 26 predicate places. [2021-03-24 19:40:47,778 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 610 flow [2021-03-24 19:40:47,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 159.28571428571428) internal successors, (1115), 7 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:47,779 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:47,779 INFO L263 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] [2021-03-24 19:40:47,779 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-24 19:40:47,779 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:47,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:47,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1923703667, now seen corresponding path program 1 times [2021-03-24 19:40:47,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:47,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873239591] [2021-03-24 19:40:47,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:47,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:47,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:47,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:47,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:40:47,844 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 19:40:47,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:40:47,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:47,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:40:47,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873239591] [2021-03-24 19:40:47,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:47,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 19:40:47,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183851954] [2021-03-24 19:40:47,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 19:40:47,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:47,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 19:40:47,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 19:40:47,855 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 195 [2021-03-24 19:40:47,855 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 77 transitions, 610 flow. Second operand has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:47,855 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:47,855 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 195 [2021-03-24 19:40:47,855 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:48,203 INFO L129 PetriNetUnfolder]: 1029/1839 cut-off events. [2021-03-24 19:40:48,204 INFO L130 PetriNetUnfolder]: For 10515/11544 co-relation queries the response was YES. [2021-03-24 19:40:48,218 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8355 conditions, 1839 events. 1029/1839 cut-off events. For 10515/11544 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 12436 event pairs, 341 based on Foata normal form. 277/1988 useless extension candidates. Maximal degree in co-relation 8310. Up to 694 conditions per place. [2021-03-24 19:40:48,234 INFO L132 encePairwiseOnDemand]: 187/195 looper letters, 17 selfloop transitions, 16 changer transitions 0/100 dead transitions. [2021-03-24 19:40:48,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 100 transitions, 722 flow [2021-03-24 19:40:48,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 19:40:48,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 19:40:48,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1174 transitions. [2021-03-24 19:40:48,237 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8600732600732601 [2021-03-24 19:40:48,237 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1174 transitions. [2021-03-24 19:40:48,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1174 transitions. [2021-03-24 19:40:48,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:48,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1174 transitions. [2021-03-24 19:40:48,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 167.71428571428572) internal successors, (1174), 7 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:48,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:48,243 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:48,243 INFO L185 Difference]: Start difference. First operand has 85 places, 77 transitions, 610 flow. Second operand 7 states and 1174 transitions. [2021-03-24 19:40:48,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 100 transitions, 722 flow [2021-03-24 19:40:48,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 100 transitions, 667 flow, removed 18 selfloop flow, removed 8 redundant places. [2021-03-24 19:40:48,258 INFO L241 Difference]: Finished difference. Result has 85 places, 92 transitions, 679 flow [2021-03-24 19:40:48,259 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=679, PETRI_PLACES=85, PETRI_TRANSITIONS=92} [2021-03-24 19:40:48,259 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 26 predicate places. [2021-03-24 19:40:48,259 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 92 transitions, 679 flow [2021-03-24 19:40:48,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:48,259 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:48,260 INFO L263 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] [2021-03-24 19:40:48,260 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-24 19:40:48,260 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:48,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:48,260 INFO L82 PathProgramCache]: Analyzing trace with hash -35453114, now seen corresponding path program 1 times [2021-03-24 19:40:48,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:48,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117776363] [2021-03-24 19:40:48,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:48,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:48,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:48,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:48,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:48,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:48,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:40:48,350 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 19:40:48,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:40:48,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:48,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:40:48,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117776363] [2021-03-24 19:40:48,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:48,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 19:40:48,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133630319] [2021-03-24 19:40:48,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 19:40:48,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:48,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 19:40:48,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-24 19:40:48,365 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 195 [2021-03-24 19:40:48,366 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 92 transitions, 679 flow. Second operand has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:48,366 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:48,366 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 195 [2021-03-24 19:40:48,366 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:48,687 INFO L129 PetriNetUnfolder]: 667/1342 cut-off events. [2021-03-24 19:40:48,687 INFO L130 PetriNetUnfolder]: For 6659/9992 co-relation queries the response was YES. [2021-03-24 19:40:48,700 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6495 conditions, 1342 events. 667/1342 cut-off events. For 6659/9992 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 9371 event pairs, 88 based on Foata normal form. 683/1933 useless extension candidates. Maximal degree in co-relation 6451. Up to 645 conditions per place. [2021-03-24 19:40:48,711 INFO L132 encePairwiseOnDemand]: 187/195 looper letters, 17 selfloop transitions, 32 changer transitions 0/116 dead transitions. [2021-03-24 19:40:48,711 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 116 transitions, 954 flow [2021-03-24 19:40:48,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-24 19:40:48,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-24 19:40:48,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1677 transitions. [2021-03-24 19:40:48,715 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.86 [2021-03-24 19:40:48,715 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1677 transitions. [2021-03-24 19:40:48,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1677 transitions. [2021-03-24 19:40:48,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:48,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1677 transitions. [2021-03-24 19:40:48,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 167.7) internal successors, (1677), 10 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:48,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 195.0) internal successors, (2145), 11 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:48,735 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 195.0) internal successors, (2145), 11 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:48,735 INFO L185 Difference]: Start difference. First operand has 85 places, 92 transitions, 679 flow. Second operand 10 states and 1677 transitions. [2021-03-24 19:40:48,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 116 transitions, 954 flow [2021-03-24 19:40:48,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 116 transitions, 954 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-24 19:40:48,747 INFO L241 Difference]: Finished difference. Result has 98 places, 108 transitions, 932 flow [2021-03-24 19:40:48,748 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=932, PETRI_PLACES=98, PETRI_TRANSITIONS=108} [2021-03-24 19:40:48,748 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 39 predicate places. [2021-03-24 19:40:48,748 INFO L480 AbstractCegarLoop]: Abstraction has has 98 places, 108 transitions, 932 flow [2021-03-24 19:40:48,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:48,749 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:48,749 INFO L263 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] [2021-03-24 19:40:48,749 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-24 19:40:48,749 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:48,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:48,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1393465529, now seen corresponding path program 1 times [2021-03-24 19:40:48,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:48,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869424401] [2021-03-24 19:40:48,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:48,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:48,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:48,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:48,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:48,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:48,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:48,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:48,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:40:48,848 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 19:40:48,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:40:48,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:48,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:40:48,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869424401] [2021-03-24 19:40:48,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:48,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-24 19:40:48,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678544878] [2021-03-24 19:40:48,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-24 19:40:48,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:48,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-24 19:40:48,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-24 19:40:48,859 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 195 [2021-03-24 19:40:48,860 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 108 transitions, 932 flow. Second operand has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:48,860 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:48,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 195 [2021-03-24 19:40:48,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:49,175 INFO L129 PetriNetUnfolder]: 517/1097 cut-off events. [2021-03-24 19:40:49,175 INFO L130 PetriNetUnfolder]: For 10743/18334 co-relation queries the response was YES. [2021-03-24 19:40:49,186 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6677 conditions, 1097 events. 517/1097 cut-off events. For 10743/18334 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 7440 event pairs, 14 based on Foata normal form. 933/1948 useless extension candidates. Maximal degree in co-relation 6627. Up to 614 conditions per place. [2021-03-24 19:40:49,197 INFO L132 encePairwiseOnDemand]: 187/195 looper letters, 8 selfloop transitions, 49 changer transitions 8/129 dead transitions. [2021-03-24 19:40:49,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 129 transitions, 1315 flow [2021-03-24 19:40:49,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-24 19:40:49,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-24 19:40:49,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2180 transitions. [2021-03-24 19:40:49,203 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8599605522682445 [2021-03-24 19:40:49,203 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2180 transitions. [2021-03-24 19:40:49,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2180 transitions. [2021-03-24 19:40:49,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:49,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2180 transitions. [2021-03-24 19:40:49,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 167.69230769230768) internal successors, (2180), 13 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:49,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 195.0) internal successors, (2730), 14 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:49,212 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 195.0) internal successors, (2730), 14 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:49,212 INFO L185 Difference]: Start difference. First operand has 98 places, 108 transitions, 932 flow. Second operand 13 states and 2180 transitions. [2021-03-24 19:40:49,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 129 transitions, 1315 flow [2021-03-24 19:40:49,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 129 transitions, 1201 flow, removed 46 selfloop flow, removed 4 redundant places. [2021-03-24 19:40:49,251 INFO L241 Difference]: Finished difference. Result has 109 places, 121 transitions, 1104 flow [2021-03-24 19:40:49,252 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1104, PETRI_PLACES=109, PETRI_TRANSITIONS=121} [2021-03-24 19:40:49,252 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 50 predicate places. [2021-03-24 19:40:49,252 INFO L480 AbstractCegarLoop]: Abstraction has has 109 places, 121 transitions, 1104 flow [2021-03-24 19:40:49,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:49,252 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:49,252 INFO L263 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] [2021-03-24 19:40:49,252 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-24 19:40:49,252 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:49,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:49,253 INFO L82 PathProgramCache]: Analyzing trace with hash 636003838, now seen corresponding path program 1 times [2021-03-24 19:40:49,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:49,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424343071] [2021-03-24 19:40:49,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:49,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:49,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:49,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:49,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:49,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:49,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:49,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:49,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:40:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:40:49,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424343071] [2021-03-24 19:40:49,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:49,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 19:40:49,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505332581] [2021-03-24 19:40:49,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 19:40:49,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:49,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 19:40:49,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 19:40:49,338 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 195 [2021-03-24 19:40:49,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 121 transitions, 1104 flow. Second operand has 5 states, 5 states have (on average 173.2) internal successors, (866), 5 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:49,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:49,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 195 [2021-03-24 19:40:49,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:49,646 INFO L129 PetriNetUnfolder]: 978/2066 cut-off events. [2021-03-24 19:40:49,646 INFO L130 PetriNetUnfolder]: For 16691/19425 co-relation queries the response was YES. [2021-03-24 19:40:49,666 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11104 conditions, 2066 events. 978/2066 cut-off events. For 16691/19425 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 16300 event pairs, 25 based on Foata normal form. 73/1989 useless extension candidates. Maximal degree in co-relation 11050. Up to 754 conditions per place. [2021-03-24 19:40:49,687 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 8 selfloop transitions, 2 changer transitions 1/126 dead transitions. [2021-03-24 19:40:49,687 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 126 transitions, 1172 flow [2021-03-24 19:40:49,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 19:40:49,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 19:40:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 872 transitions. [2021-03-24 19:40:49,690 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8943589743589744 [2021-03-24 19:40:49,690 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 872 transitions. [2021-03-24 19:40:49,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 872 transitions. [2021-03-24 19:40:49,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:49,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 872 transitions. [2021-03-24 19:40:49,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.4) internal successors, (872), 5 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:49,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:49,694 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:49,694 INFO L185 Difference]: Start difference. First operand has 109 places, 121 transitions, 1104 flow. Second operand 5 states and 872 transitions. [2021-03-24 19:40:49,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 126 transitions, 1172 flow [2021-03-24 19:40:49,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 126 transitions, 942 flow, removed 83 selfloop flow, removed 8 redundant places. [2021-03-24 19:40:49,903 INFO L241 Difference]: Finished difference. Result has 108 places, 122 transitions, 889 flow [2021-03-24 19:40:49,904 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=889, PETRI_PLACES=108, PETRI_TRANSITIONS=122} [2021-03-24 19:40:49,904 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 49 predicate places. [2021-03-24 19:40:49,904 INFO L480 AbstractCegarLoop]: Abstraction has has 108 places, 122 transitions, 889 flow [2021-03-24 19:40:49,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 173.2) internal successors, (866), 5 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:49,904 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:49,904 INFO L263 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] [2021-03-24 19:40:49,904 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-24 19:40:49,905 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:49,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:49,905 INFO L82 PathProgramCache]: Analyzing trace with hash 999945446, now seen corresponding path program 2 times [2021-03-24 19:40:49,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:49,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398473873] [2021-03-24 19:40:49,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:49,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:49,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:49,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:49,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:49,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:49,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:49,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:49,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:49,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:49,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:40:50,007 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 19:40:50,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:40:50,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:50,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:40:50,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398473873] [2021-03-24 19:40:50,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:50,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-24 19:40:50,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425760690] [2021-03-24 19:40:50,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-24 19:40:50,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:50,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-24 19:40:50,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-24 19:40:50,019 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 195 [2021-03-24 19:40:50,020 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 122 transitions, 889 flow. Second operand has 8 states, 8 states have (on average 163.875) internal successors, (1311), 8 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:50,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:50,020 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 195 [2021-03-24 19:40:50,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:50,483 INFO L129 PetriNetUnfolder]: 939/1969 cut-off events. [2021-03-24 19:40:50,483 INFO L130 PetriNetUnfolder]: For 8452/14189 co-relation queries the response was YES. [2021-03-24 19:40:50,503 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8812 conditions, 1969 events. 939/1969 cut-off events. For 8452/14189 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 15577 event pairs, 10 based on Foata normal form. 1656/3477 useless extension candidates. Maximal degree in co-relation 8778. Up to 385 conditions per place. [2021-03-24 19:40:50,510 INFO L132 encePairwiseOnDemand]: 187/195 looper letters, 3 selfloop transitions, 55 changer transitions 9/131 dead transitions. [2021-03-24 19:40:50,510 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 131 transitions, 1103 flow [2021-03-24 19:40:50,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-24 19:40:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-03-24 19:40:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2671 transitions. [2021-03-24 19:40:50,517 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8560897435897435 [2021-03-24 19:40:50,517 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2671 transitions. [2021-03-24 19:40:50,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2671 transitions. [2021-03-24 19:40:50,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:50,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2671 transitions. [2021-03-24 19:40:50,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 166.9375) internal successors, (2671), 16 states have internal predecessors, (2671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:50,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 195.0) internal successors, (3315), 17 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:50,527 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 195.0) internal successors, (3315), 17 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:50,527 INFO L185 Difference]: Start difference. First operand has 108 places, 122 transitions, 889 flow. Second operand 16 states and 2671 transitions. [2021-03-24 19:40:50,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 131 transitions, 1103 flow [2021-03-24 19:40:50,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 131 transitions, 1048 flow, removed 19 selfloop flow, removed 5 redundant places. [2021-03-24 19:40:50,672 INFO L241 Difference]: Finished difference. Result has 122 places, 122 transitions, 960 flow [2021-03-24 19:40:50,673 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=960, PETRI_PLACES=122, PETRI_TRANSITIONS=122} [2021-03-24 19:40:50,673 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 63 predicate places. [2021-03-24 19:40:50,673 INFO L480 AbstractCegarLoop]: Abstraction has has 122 places, 122 transitions, 960 flow [2021-03-24 19:40:50,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 163.875) internal successors, (1311), 8 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:50,673 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:50,674 INFO L263 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] [2021-03-24 19:40:50,674 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-24 19:40:50,674 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:50,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:50,674 INFO L82 PathProgramCache]: Analyzing trace with hash -2012911133, now seen corresponding path program 1 times [2021-03-24 19:40:50,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:50,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300715660] [2021-03-24 19:40:50,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:50,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:50,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:50,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:50,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:50,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:50,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:40:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:40:50,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300715660] [2021-03-24 19:40:50,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:50,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 19:40:50,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578070273] [2021-03-24 19:40:50,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 19:40:50,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:50,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 19:40:50,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 19:40:50,775 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 195 [2021-03-24 19:40:50,775 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 122 transitions, 960 flow. Second operand has 4 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:50,776 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:50,776 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 195 [2021-03-24 19:40:50,776 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:51,193 INFO L129 PetriNetUnfolder]: 1833/3815 cut-off events. [2021-03-24 19:40:51,193 INFO L130 PetriNetUnfolder]: For 12898/14690 co-relation queries the response was YES. [2021-03-24 19:40:51,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16938 conditions, 3815 events. 1833/3815 cut-off events. For 12898/14690 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 33508 event pairs, 20 based on Foata normal form. 87/3633 useless extension candidates. Maximal degree in co-relation 16882. Up to 763 conditions per place. [2021-03-24 19:40:51,245 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 4 selfloop transitions, 2 changer transitions 1/124 dead transitions. [2021-03-24 19:40:51,245 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 124 transitions, 980 flow [2021-03-24 19:40:51,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-24 19:40:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-24 19:40:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 700 transitions. [2021-03-24 19:40:51,247 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8974358974358975 [2021-03-24 19:40:51,247 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 700 transitions. [2021-03-24 19:40:51,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 700 transitions. [2021-03-24 19:40:51,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:51,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 700 transitions. [2021-03-24 19:40:51,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:51,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:51,253 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:51,253 INFO L185 Difference]: Start difference. First operand has 122 places, 122 transitions, 960 flow. Second operand 4 states and 700 transitions. [2021-03-24 19:40:51,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 124 transitions, 980 flow [2021-03-24 19:40:51,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 124 transitions, 821 flow, removed 34 selfloop flow, removed 15 redundant places. [2021-03-24 19:40:51,671 INFO L241 Difference]: Finished difference. Result has 110 places, 123 transitions, 815 flow [2021-03-24 19:40:51,671 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=815, PETRI_PLACES=110, PETRI_TRANSITIONS=123} [2021-03-24 19:40:51,671 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 51 predicate places. [2021-03-24 19:40:51,671 INFO L480 AbstractCegarLoop]: Abstraction has has 110 places, 123 transitions, 815 flow [2021-03-24 19:40:51,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:51,672 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:51,672 INFO L263 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] [2021-03-24 19:40:51,672 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-24 19:40:51,672 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:51,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:51,672 INFO L82 PathProgramCache]: Analyzing trace with hash -919437741, now seen corresponding path program 2 times [2021-03-24 19:40:51,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:51,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306884176] [2021-03-24 19:40:51,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:40:51,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:51,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:40:51,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:51,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:51,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:51,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:40:51,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:40:51,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:40:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:40:51,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306884176] [2021-03-24 19:40:51,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:40:51,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 19:40:51,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320490813] [2021-03-24 19:40:51,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 19:40:51,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:40:51,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 19:40:51,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 19:40:51,779 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 195 [2021-03-24 19:40:51,780 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 123 transitions, 815 flow. Second operand has 5 states, 5 states have (on average 173.2) internal successors, (866), 5 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:51,780 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:40:51,780 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 195 [2021-03-24 19:40:51,780 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:40:52,375 INFO L129 PetriNetUnfolder]: 3212/6578 cut-off events. [2021-03-24 19:40:52,375 INFO L130 PetriNetUnfolder]: For 14845/16437 co-relation queries the response was YES. [2021-03-24 19:40:52,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24481 conditions, 6578 events. 3212/6578 cut-off events. For 14845/16437 co-relation queries the response was YES. Maximal size of possible extension queue 1029. Compared 62900 event pairs, 38 based on Foata normal form. 144/6219 useless extension candidates. Maximal degree in co-relation 24450. Up to 1344 conditions per place. [2021-03-24 19:40:52,528 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 5 selfloop transitions, 2 changer transitions 7/125 dead transitions. [2021-03-24 19:40:52,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 125 transitions, 839 flow [2021-03-24 19:40:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 19:40:52,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 19:40:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 869 transitions. [2021-03-24 19:40:52,529 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8912820512820513 [2021-03-24 19:40:52,530 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 869 transitions. [2021-03-24 19:40:52,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 869 transitions. [2021-03-24 19:40:52,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:40:52,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 869 transitions. [2021-03-24 19:40:52,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 173.8) internal successors, (869), 5 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:52,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:52,532 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:52,532 INFO L185 Difference]: Start difference. First operand has 110 places, 123 transitions, 815 flow. Second operand 5 states and 869 transitions. [2021-03-24 19:40:52,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 125 transitions, 839 flow [2021-03-24 19:40:53,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 125 transitions, 835 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-24 19:40:53,242 INFO L241 Difference]: Finished difference. Result has 114 places, 118 transitions, 777 flow [2021-03-24 19:40:53,242 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=777, PETRI_PLACES=114, PETRI_TRANSITIONS=118} [2021-03-24 19:40:53,243 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 55 predicate places. [2021-03-24 19:40:53,243 INFO L480 AbstractCegarLoop]: Abstraction has has 114 places, 118 transitions, 777 flow [2021-03-24 19:40:53,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 173.2) internal successors, (866), 5 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:40:53,243 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:40:53,243 INFO L263 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] [2021-03-24 19:40:53,243 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-24 19:40:53,243 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:40:53,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:40:53,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1741245313, now seen corresponding path program 3 times [2021-03-24 19:40:53,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:40:53,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262571190] [2021-03-24 19:40:53,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:40:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 19:40:53,282 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 19:40:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 19:40:53,353 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 19:40:53,383 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-24 19:40:53,383 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-24 19:40:53,384 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-24 19:40:53,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.03 07:40:53 BasicIcfg [2021-03-24 19:40:53,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-24 19:40:53,503 INFO L168 Benchmark]: Toolchain (without parser) took 21025.47 ms. Allocated memory was 339.7 MB in the beginning and 736.1 MB in the end (delta: 396.4 MB). Free memory was 302.6 MB in the beginning and 338.4 MB in the end (delta: -35.8 MB). Peak memory consumption was 360.6 MB. Max. memory is 16.0 GB. [2021-03-24 19:40:53,505 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 339.7 MB. Free memory was 321.0 MB in the beginning and 320.9 MB in the end (delta: 69.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-24 19:40:53,505 INFO L168 Benchmark]: CACSL2BoogieTranslator took 533.39 ms. Allocated memory is still 339.7 MB. Free memory was 302.4 MB in the beginning and 297.5 MB in the end (delta: 4.9 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.0 GB. [2021-03-24 19:40:53,505 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.78 ms. Allocated memory is still 339.7 MB. Free memory was 297.5 MB in the beginning and 294.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-24 19:40:53,506 INFO L168 Benchmark]: Boogie Preprocessor took 30.94 ms. Allocated memory is still 339.7 MB. Free memory was 294.3 MB in the beginning and 292.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-24 19:40:53,506 INFO L168 Benchmark]: RCFGBuilder took 1997.34 ms. Allocated memory is still 339.7 MB. Free memory was 292.2 MB in the beginning and 210.7 MB in the end (delta: 81.5 MB). Peak memory consumption was 146.5 MB. Max. memory is 16.0 GB. [2021-03-24 19:40:53,507 INFO L168 Benchmark]: TraceAbstraction took 18399.74 ms. Allocated memory was 339.7 MB in the beginning and 736.1 MB in the end (delta: 396.4 MB). Free memory was 210.7 MB in the beginning and 338.4 MB in the end (delta: -127.7 MB). Peak memory consumption was 267.6 MB. Max. memory is 16.0 GB. [2021-03-24 19:40:53,513 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 339.7 MB. Free memory was 321.0 MB in the beginning and 320.9 MB in the end (delta: 69.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 533.39 ms. Allocated memory is still 339.7 MB. Free memory was 302.4 MB in the beginning and 297.5 MB in the end (delta: 4.9 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 57.78 ms. Allocated memory is still 339.7 MB. Free memory was 297.5 MB in the beginning and 294.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 30.94 ms. Allocated memory is still 339.7 MB. Free memory was 294.3 MB in the beginning and 292.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1997.34 ms. Allocated memory is still 339.7 MB. Free memory was 292.2 MB in the beginning and 210.7 MB in the end (delta: 81.5 MB). Peak memory consumption was 146.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 18399.74 ms. Allocated memory was 339.7 MB in the beginning and 736.1 MB in the end (delta: 396.4 MB). Free memory was 210.7 MB in the beginning and 338.4 MB in the end (delta: -127.7 MB). Peak memory consumption was 267.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8766.9ms, 126 PlacesBefore, 59 PlacesAfterwards, 115 TransitionsBefore, 47 TransitionsAfterwards, 2868 CoEnabledTransitionPairs, 5 FixpointIterations, 30 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 5220 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2690, positive: 2579, positive conditional: 0, positive unconditional: 2579, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1885, positive: 1832, positive conditional: 0, positive unconditional: 1832, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1885, positive: 1832, positive conditional: 0, positive unconditional: 1832, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1885, positive: 1820, positive conditional: 0, positive unconditional: 1820, negative: 65, negative conditional: 0, negative unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1088, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 1045, negative conditional: 0, negative unconditional: 1045, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2690, positive: 747, positive conditional: 0, positive unconditional: 747, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 1885, unknown conditional: 0, unknown unconditional: 1885] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 217, Positive conditional cache size: 0, Positive unconditional cache size: 217, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L740] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1185; [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t1186; [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t1187; [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L862] 0 pthread_t t1188; [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L822] 4 z = 2 [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L834] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L834] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L834] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L834] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L835] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L836] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L838] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L869] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L869] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L869] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L869] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L871] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L873] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L880] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L881] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L881] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L881] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L881] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L882] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L882] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L882] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L882] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L883] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L883] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L883] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L883] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L884] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L884] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L885] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L885] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L886] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L886] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 18156.6ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 6947.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8844.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 99 SDtfs, 165 SDslu, 130 SDs, 0 SdLazy, 660 SolverSat, 300 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 881.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 840.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1104occurred in iteration=11, InterpolantAutomatonStates: 123, 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: 59.3ms SsaConstructionTime, 662.3ms SatisfiabilityAnalysisTime, 1290.9ms InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 442 ConstructedInterpolants, 0 QuantifiedInterpolants, 2125 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...