/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/mix039_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-10 20:54:54,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-10 20:54:54,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-10 20:54:54,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-10 20:54:54,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-10 20:54:54,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-10 20:54:54,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-10 20:54:54,122 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-10 20:54:54,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-10 20:54:54,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-10 20:54:54,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-10 20:54:54,124 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-10 20:54:54,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-10 20:54:54,125 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-10 20:54:54,126 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-10 20:54:54,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-10 20:54:54,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-10 20:54:54,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-10 20:54:54,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-10 20:54:54,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-10 20:54:54,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-10 20:54:54,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-10 20:54:54,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-10 20:54:54,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-10 20:54:54,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-10 20:54:54,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-10 20:54:54,134 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-10 20:54:54,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-10 20:54:54,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-10 20:54:54,136 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-10 20:54:54,136 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-10 20:54:54,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-10 20:54:54,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-10 20:54:54,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-10 20:54:54,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-10 20:54:54,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-10 20:54:54,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-10 20:54:54,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-10 20:54:54,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-10 20:54:54,139 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-10 20:54:54,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-10 20:54:54,140 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-06-10 20:54:54,155 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-10 20:54:54,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-10 20:54:54,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-10 20:54:54,156 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-10 20:54:54,156 INFO L138 SettingsManager]: * Use SBE=true [2021-06-10 20:54:54,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-10 20:54:54,156 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-10 20:54:54,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-10 20:54:54,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-10 20:54:54,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-10 20:54:54,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-10 20:54:54,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-10 20:54:54,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-10 20:54:54,157 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-10 20:54:54,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-10 20:54:54,157 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-10 20:54:54,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-10 20:54:54,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-10 20:54:54,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-10 20:54:54,158 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-10 20:54:54,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-10 20:54:54,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 20:54:54,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-10 20:54:54,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-10 20:54:54,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-10 20:54:54,159 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-10 20:54:54,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-10 20:54:54,159 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-10 20:54:54,159 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-10 20:54:54,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-10 20:54:54,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-10 20:54:54,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-10 20:54:54,395 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-10 20:54:54,396 INFO L275 PluginConnector]: CDTParser initialized [2021-06-10 20:54:54,397 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039_rmo.oepc.i [2021-06-10 20:54:54,444 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e5c1bcef/6771f108f4ec457f9bb101d2f5a35e0a/FLAGc2bd83687 [2021-06-10 20:54:54,850 INFO L306 CDTParser]: Found 1 translation units. [2021-06-10 20:54:54,851 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039_rmo.oepc.i [2021-06-10 20:54:54,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e5c1bcef/6771f108f4ec457f9bb101d2f5a35e0a/FLAGc2bd83687 [2021-06-10 20:54:54,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e5c1bcef/6771f108f4ec457f9bb101d2f5a35e0a [2021-06-10 20:54:54,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-10 20:54:54,878 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-10 20:54:54,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-10 20:54:54,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-10 20:54:54,883 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-10 20:54:54,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 08:54:54" (1/1) ... [2021-06-10 20:54:54,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ead5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:54, skipping insertion in model container [2021-06-10 20:54:54,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 08:54:54" (1/1) ... [2021-06-10 20:54:54,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-10 20:54:54,923 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-10 20:54:55,056 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/mix039_rmo.oepc.i[949,962] [2021-06-10 20:54:55,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 20:54:55,208 INFO L203 MainTranslator]: Completed pre-run [2021-06-10 20:54:55,216 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/mix039_rmo.oepc.i[949,962] [2021-06-10 20:54:55,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 20:54:55,294 INFO L208 MainTranslator]: Completed translation [2021-06-10 20:54:55,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:55 WrapperNode [2021-06-10 20:54:55,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-10 20:54:55,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-10 20:54:55,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-10 20:54:55,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-10 20:54:55,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:55" (1/1) ... [2021-06-10 20:54:55,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:55" (1/1) ... [2021-06-10 20:54:55,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-10 20:54:55,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-10 20:54:55,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-10 20:54:55,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-10 20:54:55,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:55" (1/1) ... [2021-06-10 20:54:55,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:55" (1/1) ... [2021-06-10 20:54:55,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:55" (1/1) ... [2021-06-10 20:54:55,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:55" (1/1) ... [2021-06-10 20:54:55,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:55" (1/1) ... [2021-06-10 20:54:55,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:55" (1/1) ... [2021-06-10 20:54:55,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:55" (1/1) ... [2021-06-10 20:54:55,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-10 20:54:55,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-10 20:54:55,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-10 20:54:55,377 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-10 20:54:55,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 20:54:55,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-10 20:54:55,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-10 20:54:55,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-10 20:54:55,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-10 20:54:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-10 20:54:55,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-10 20:54:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-10 20:54:55,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-10 20:54:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-10 20:54:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-10 20:54:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-10 20:54:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-10 20:54:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-10 20:54:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-10 20:54:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-10 20:54:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-10 20:54:55,456 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-10 20:54:56,970 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-10 20:54:56,971 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-10 20:54:56,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 08:54:56 BoogieIcfgContainer [2021-06-10 20:54:56,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-10 20:54:56,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-10 20:54:56,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-10 20:54:56,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-10 20:54:56,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 08:54:54" (1/3) ... [2021-06-10 20:54:56,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314efedc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 08:54:56, skipping insertion in model container [2021-06-10 20:54:56,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:54:55" (2/3) ... [2021-06-10 20:54:56,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314efedc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 08:54:56, skipping insertion in model container [2021-06-10 20:54:56,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 08:54:56" (3/3) ... [2021-06-10 20:54:56,976 INFO L111 eAbstractionObserver]: Analyzing ICFG mix039_rmo.oepc.i [2021-06-10 20:54:56,983 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-10 20:54:56,986 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-10 20:54:56,986 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-10 20:54:57,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,018 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,018 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,018 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,018 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,018 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,019 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,019 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,019 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,023 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,023 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,023 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,023 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,024 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,025 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,025 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,025 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,025 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,025 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,026 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,026 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,026 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,026 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,029 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,029 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,029 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,029 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,029 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,029 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,029 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,029 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,029 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,029 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,030 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,030 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,030 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,030 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,030 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,030 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,031 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,033 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,033 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,033 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,034 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,037 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,038 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,039 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,041 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,042 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,043 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,043 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,043 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,043 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,043 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,043 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,043 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,043 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,043 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,043 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,043 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,043 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,043 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,045 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,045 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,045 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,046 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,046 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,046 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,046 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,046 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,046 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,046 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,046 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,046 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,046 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,046 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,047 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,047 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,047 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,047 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,048 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,048 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,049 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,049 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,051 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,051 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,051 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,051 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,051 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,051 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,056 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,057 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,057 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,058 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,058 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,065 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,065 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 20:54:57,066 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 20:54:57,077 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-10 20:54:57,098 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 20:54:57,098 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 20:54:57,098 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 20:54:57,098 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 20:54:57,098 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 20:54:57,098 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 20:54:57,098 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 20:54:57,098 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 20:54:57,108 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2021-06-10 20:54:57,147 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-06-10 20:54:57,147 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:54:57,157 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-06-10 20:54:57,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 120 transitions, 260 flow [2021-06-10 20:54:57,163 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 116 transitions, 244 flow [2021-06-10 20:54:57,164 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 20:54:57,172 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 244 flow [2021-06-10 20:54:57,174 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 244 flow [2021-06-10 20:54:57,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 244 flow [2021-06-10 20:54:57,200 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-06-10 20:54:57,201 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:54:57,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-06-10 20:54:57,205 INFO L151 LiptonReduction]: Number of co-enabled transitions 2876 [2021-06-10 20:54:57,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,293 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:57,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:54:57,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:54:57,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:57,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:57,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:57,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:57,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:57,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:57,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:57,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:57,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:57,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,590 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:57,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:54:57,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:54:57,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:57,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:57,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:57,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:57,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:57,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:57,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,850 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:57,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:54:57,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:54:57,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,890 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:57,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:54:57,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:54:57,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:57,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:57,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:57,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:58,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:58,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:58,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:58,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,161 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:58,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:54:58,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:54:58,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,237 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-10 20:54:58,238 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:54:58,256 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:58,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:58,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:58,486 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-10 20:54:58,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:58,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:58,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:58,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:58,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:58,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:58,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:58,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:58,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:58,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:58,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:58,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:58,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:58,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:59,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:59,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:59,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:59,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:59,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:59,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:59,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:59,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:54:59,359 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-10 20:54:59,664 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-10 20:54:59,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:59,784 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:59,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:59,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-10 20:54:59,791 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:59,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:59,795 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-10 20:54:59,795 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:54:59,797 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:59,799 INFO L147 QuantifierPusher]: treesize reduction 37, result has 63.0 percent of original size 63 [2021-06-10 20:54:59,799 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:54:59,800 INFO L142 QuantifierPusher]: treesize reduction 37, result has 76.9 percent of original size [2021-06-10 20:54:59,801 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 2, 1] term [2021-06-10 20:54:59,801 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:54:59,803 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:59,807 INFO L147 QuantifierPusher]: treesize reduction 89, result has 36.0 percent of original size 50 [2021-06-10 20:54:59,809 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 4, 2, 1] term [2021-06-10 20:54:59,810 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 20:54:59,812 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:59,820 INFO L147 QuantifierPusher]: treesize reduction 154, result has 42.1 percent of original size 112 [2021-06-10 20:54:59,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:54:59,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:00,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,053 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:55:00,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:55:00,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:55:00,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:00,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:00,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:00,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:00,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,230 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:55:00,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:55:00,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:55:00,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:00,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,329 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-10 20:55:00,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:00,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:00,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:00,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:00,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:00,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,699 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:55:00,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:55:00,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:55:00,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,813 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:55:00,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,814 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:55:00,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-10 20:55:00,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:55:00,821 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:55:00,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,822 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:55:00,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-10 20:55:00,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-10 20:55:00,824 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:55:00,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:00,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-10 20:55:00,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-10 20:55:01,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:01,107 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:55:01,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:01,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:55:01,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:55:01,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:01,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:01,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:01,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:01,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:01,707 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:55:01,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:01,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:55:01,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:55:02,054 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-06-10 20:55:02,233 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-06-10 20:55:02,566 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-06-10 20:55:02,708 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-06-10 20:55:02,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:02,723 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 20:55:02,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:02,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:55:02,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 20:55:02,774 INFO L163 LiptonReduction]: Checked pairs total: 9088 [2021-06-10 20:55:02,774 INFO L165 LiptonReduction]: Total number of compositions: 105 [2021-06-10 20:55:02,776 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5613 [2021-06-10 20:55:02,781 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 20:55:02,781 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:55:02,781 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:55:02,781 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-06-10 20:55:02,781 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:55:02,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:55:02,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1227909, now seen corresponding path program 1 times [2021-06-10 20:55:02,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:55:02,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927599060] [2021-06-10 20:55:02,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:55:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:55:02,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:02,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:55:02,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927599060] [2021-06-10 20:55:02,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:55:02,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 20:55:02,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729632469] [2021-06-10 20:55:02,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 20:55:02,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:55:02,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 20:55:02,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 20:55:02,903 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 225 [2021-06-10 20:55:02,906 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:02,906 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:55:02,907 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 225 [2021-06-10 20:55:02,907 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:55:02,977 INFO L129 PetriNetUnfolder]: 133/306 cut-off events. [2021-06-10 20:55:02,977 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:55:02,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 306 events. 133/306 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1579 event pairs, 110 based on Foata normal form. 69/343 useless extension candidates. Maximal degree in co-relation 514. Up to 153 conditions per place. [2021-06-10 20:55:02,980 INFO L132 encePairwiseOnDemand]: 220/225 looper letters, 11 selfloop transitions, 2 changer transitions 1/38 dead transitions. [2021-06-10 20:55:02,980 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 38 transitions, 114 flow [2021-06-10 20:55:02,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 20:55:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 20:55:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 582 transitions. [2021-06-10 20:55:02,990 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8622222222222222 [2021-06-10 20:55:02,990 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 582 transitions. [2021-06-10 20:55:02,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 582 transitions. [2021-06-10 20:55:02,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:55:02,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 582 transitions. [2021-06-10 20:55:02,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:02,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,000 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,001 INFO L185 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 582 transitions. [2021-06-10 20:55:03,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 38 transitions, 114 flow [2021-06-10 20:55:03,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-06-10 20:55:03,004 INFO L241 Difference]: Finished difference. Result has 44 places, 32 transitions, 76 flow [2021-06-10 20:55:03,005 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2021-06-10 20:55:03,006 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2021-06-10 20:55:03,006 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 76 flow [2021-06-10 20:55:03,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,006 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:55:03,006 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:55:03,006 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-10 20:55:03,006 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:55:03,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:55:03,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1894779745, now seen corresponding path program 1 times [2021-06-10 20:55:03,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:55:03,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127573389] [2021-06-10 20:55:03,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:55:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:55:03,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:03,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:55:03,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127573389] [2021-06-10 20:55:03,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:55:03,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 20:55:03,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715042398] [2021-06-10 20:55:03,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 20:55:03,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:55:03,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 20:55:03,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 20:55:03,070 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 225 [2021-06-10 20:55:03,070 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,070 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:55:03,070 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 225 [2021-06-10 20:55:03,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:55:03,078 INFO L129 PetriNetUnfolder]: 1/34 cut-off events. [2021-06-10 20:55:03,078 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 20:55:03,078 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 34 events. 1/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 44. Up to 5 conditions per place. [2021-06-10 20:55:03,078 INFO L132 encePairwiseOnDemand]: 222/225 looper letters, 1 selfloop transitions, 2 changer transitions 5/33 dead transitions. [2021-06-10 20:55:03,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 33 transitions, 88 flow [2021-06-10 20:55:03,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 20:55:03,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 20:55:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 588 transitions. [2021-06-10 20:55:03,080 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8711111111111111 [2021-06-10 20:55:03,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 588 transitions. [2021-06-10 20:55:03,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 588 transitions. [2021-06-10 20:55:03,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:55:03,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 588 transitions. [2021-06-10 20:55:03,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,083 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,083 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 588 transitions. [2021-06-10 20:55:03,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 33 transitions, 88 flow [2021-06-10 20:55:03,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 20:55:03,084 INFO L241 Difference]: Finished difference. Result has 44 places, 28 transitions, 72 flow [2021-06-10 20:55:03,084 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2021-06-10 20:55:03,084 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2021-06-10 20:55:03,084 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 72 flow [2021-06-10 20:55:03,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,085 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:55:03,085 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:55:03,085 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-10 20:55:03,085 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:55:03,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:55:03,085 INFO L82 PathProgramCache]: Analyzing trace with hash 145781010, now seen corresponding path program 1 times [2021-06-10 20:55:03,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:55:03,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3292856] [2021-06-10 20:55:03,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:55:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:55:03,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:03,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:55:03,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3292856] [2021-06-10 20:55:03,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:55:03,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 20:55:03,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336671355] [2021-06-10 20:55:03,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 20:55:03,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:55:03,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 20:55:03,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 20:55:03,141 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 225 [2021-06-10 20:55:03,141 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,141 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:55:03,141 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 225 [2021-06-10 20:55:03,141 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:55:03,148 INFO L129 PetriNetUnfolder]: 3/40 cut-off events. [2021-06-10 20:55:03,148 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-06-10 20:55:03,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 40 events. 3/40 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 1 based on Foata normal form. 1/39 useless extension candidates. Maximal degree in co-relation 58. Up to 10 conditions per place. [2021-06-10 20:55:03,149 INFO L132 encePairwiseOnDemand]: 221/225 looper letters, 3 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2021-06-10 20:55:03,149 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 88 flow [2021-06-10 20:55:03,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 20:55:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 20:55:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2021-06-10 20:55:03,151 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8592592592592593 [2021-06-10 20:55:03,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 580 transitions. [2021-06-10 20:55:03,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions. [2021-06-10 20:55:03,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:55:03,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions. [2021-06-10 20:55:03,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,154 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,154 INFO L185 Difference]: Start difference. First operand has 44 places, 28 transitions, 72 flow. Second operand 3 states and 580 transitions. [2021-06-10 20:55:03,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 88 flow [2021-06-10 20:55:03,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 20:55:03,155 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 87 flow [2021-06-10 20:55:03,155 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2021-06-10 20:55:03,155 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2021-06-10 20:55:03,155 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 87 flow [2021-06-10 20:55:03,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,156 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:55:03,156 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:55:03,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-10 20:55:03,156 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:55:03,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:55:03,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2085588849, now seen corresponding path program 1 times [2021-06-10 20:55:03,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:55:03,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276214404] [2021-06-10 20:55:03,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:55:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:55:03,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:03,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:03,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:03,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:03,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:03,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:55:03,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276214404] [2021-06-10 20:55:03,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:55:03,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 20:55:03,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905619741] [2021-06-10 20:55:03,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 20:55:03,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:55:03,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 20:55:03,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-10 20:55:03,257 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 225 [2021-06-10 20:55:03,258 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,258 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:55:03,258 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 225 [2021-06-10 20:55:03,258 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:55:03,313 INFO L129 PetriNetUnfolder]: 141/285 cut-off events. [2021-06-10 20:55:03,313 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-06-10 20:55:03,315 INFO L84 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 285 events. 141/285 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1431 event pairs, 74 based on Foata normal form. 20/279 useless extension candidates. Maximal degree in co-relation 571. Up to 163 conditions per place. [2021-06-10 20:55:03,317 INFO L132 encePairwiseOnDemand]: 218/225 looper letters, 9 selfloop transitions, 9 changer transitions 2/43 dead transitions. [2021-06-10 20:55:03,317 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 153 flow [2021-06-10 20:55:03,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 20:55:03,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 20:55:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 932 transitions. [2021-06-10 20:55:03,320 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8284444444444444 [2021-06-10 20:55:03,320 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 932 transitions. [2021-06-10 20:55:03,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 932 transitions. [2021-06-10 20:55:03,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:55:03,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 932 transitions. [2021-06-10 20:55:03,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 186.4) internal successors, (932), 5 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 225.0) internal successors, (1350), 6 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,324 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 225.0) internal successors, (1350), 6 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,324 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 87 flow. Second operand 5 states and 932 transitions. [2021-06-10 20:55:03,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 153 flow [2021-06-10 20:55:03,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 20:55:03,326 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 153 flow [2021-06-10 20:55:03,326 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-06-10 20:55:03,326 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2021-06-10 20:55:03,326 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 153 flow [2021-06-10 20:55:03,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,327 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:55:03,327 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:55:03,327 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-10 20:55:03,327 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:55:03,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:55:03,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1615045883, now seen corresponding path program 1 times [2021-06-10 20:55:03,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:55:03,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658511710] [2021-06-10 20:55:03,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:55:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:55:03,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:03,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:03,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:03,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:03,404 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-10 20:55:03,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-10 20:55:03,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-06-10 20:55:03,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658511710] [2021-06-10 20:55:03,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:55:03,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 20:55:03,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516815477] [2021-06-10 20:55:03,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 20:55:03,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:55:03,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 20:55:03,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-10 20:55:03,414 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 225 [2021-06-10 20:55:03,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,415 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:55:03,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 225 [2021-06-10 20:55:03,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:55:03,544 INFO L129 PetriNetUnfolder]: 568/1166 cut-off events. [2021-06-10 20:55:03,544 INFO L130 PetriNetUnfolder]: For 875/1162 co-relation queries the response was YES. [2021-06-10 20:55:03,548 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3203 conditions, 1166 events. 568/1166 cut-off events. For 875/1162 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 8380 event pairs, 270 based on Foata normal form. 54/1110 useless extension candidates. Maximal degree in co-relation 3188. Up to 730 conditions per place. [2021-06-10 20:55:03,553 INFO L132 encePairwiseOnDemand]: 219/225 looper letters, 10 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2021-06-10 20:55:03,553 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 211 flow [2021-06-10 20:55:03,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-10 20:55:03,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-10 20:55:03,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 718 transitions. [2021-06-10 20:55:03,555 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7977777777777778 [2021-06-10 20:55:03,555 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 718 transitions. [2021-06-10 20:55:03,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 718 transitions. [2021-06-10 20:55:03,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:55:03,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 718 transitions. [2021-06-10 20:55:03,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 179.5) internal successors, (718), 4 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,558 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,558 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 153 flow. Second operand 4 states and 718 transitions. [2021-06-10 20:55:03,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 211 flow [2021-06-10 20:55:03,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 20:55:03,561 INFO L241 Difference]: Finished difference. Result has 51 places, 42 transitions, 194 flow [2021-06-10 20:55:03,561 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2021-06-10 20:55:03,561 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2021-06-10 20:55:03,561 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 194 flow [2021-06-10 20:55:03,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,562 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:55:03,562 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:55:03,562 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-10 20:55:03,562 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:55:03,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:55:03,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1662008449, now seen corresponding path program 1 times [2021-06-10 20:55:03,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:55:03,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364607901] [2021-06-10 20:55:03,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:55:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:55:03,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:03,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:03,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:03,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:03,597 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-10 20:55:03,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-10 20:55:03,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:55:03,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364607901] [2021-06-10 20:55:03,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:55:03,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 20:55:03,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66239116] [2021-06-10 20:55:03,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 20:55:03,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:55:03,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 20:55:03,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-10 20:55:03,606 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 225 [2021-06-10 20:55:03,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 171.5) internal successors, (686), 4 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,607 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:55:03,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 225 [2021-06-10 20:55:03,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:55:03,775 INFO L129 PetriNetUnfolder]: 946/1935 cut-off events. [2021-06-10 20:55:03,775 INFO L130 PetriNetUnfolder]: For 2039/3190 co-relation queries the response was YES. [2021-06-10 20:55:03,783 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5491 conditions, 1935 events. 946/1935 cut-off events. For 2039/3190 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 15599 event pairs, 408 based on Foata normal form. 83/1785 useless extension candidates. Maximal degree in co-relation 5473. Up to 1253 conditions per place. [2021-06-10 20:55:03,792 INFO L132 encePairwiseOnDemand]: 216/225 looper letters, 14 selfloop transitions, 20 changer transitions 0/61 dead transitions. [2021-06-10 20:55:03,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 357 flow [2021-06-10 20:55:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 20:55:03,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 20:55:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 875 transitions. [2021-06-10 20:55:03,795 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2021-06-10 20:55:03,795 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 875 transitions. [2021-06-10 20:55:03,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 875 transitions. [2021-06-10 20:55:03,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:55:03,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 875 transitions. [2021-06-10 20:55:03,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 225.0) internal successors, (1350), 6 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,799 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 225.0) internal successors, (1350), 6 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,799 INFO L185 Difference]: Start difference. First operand has 51 places, 42 transitions, 194 flow. Second operand 5 states and 875 transitions. [2021-06-10 20:55:03,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 357 flow [2021-06-10 20:55:03,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 349 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-06-10 20:55:03,807 INFO L241 Difference]: Finished difference. Result has 58 places, 56 transitions, 347 flow [2021-06-10 20:55:03,808 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2021-06-10 20:55:03,808 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2021-06-10 20:55:03,808 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 347 flow [2021-06-10 20:55:03,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.5) internal successors, (686), 4 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,808 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:55:03,808 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 20:55:03,808 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-10 20:55:03,808 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:55:03,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:55:03,809 INFO L82 PathProgramCache]: Analyzing trace with hash -269522111, now seen corresponding path program 2 times [2021-06-10 20:55:03,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:55:03,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033729322] [2021-06-10 20:55:03,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:55:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:55:03,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:03,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:03,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:03,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:03,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:03,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:03,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:03,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:03,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:55:03,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033729322] [2021-06-10 20:55:03,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:55:03,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 20:55:03,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021477020] [2021-06-10 20:55:03,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 20:55:03,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:55:03,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 20:55:03,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-10 20:55:03,892 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 225 [2021-06-10 20:55:03,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 347 flow. Second operand has 5 states, 5 states have (on average 182.8) internal successors, (914), 5 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:03,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:55:03,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 225 [2021-06-10 20:55:03,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:55:04,053 INFO L129 PetriNetUnfolder]: 715/1625 cut-off events. [2021-06-10 20:55:04,053 INFO L130 PetriNetUnfolder]: For 2246/4844 co-relation queries the response was YES. [2021-06-10 20:55:04,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6018 conditions, 1625 events. 715/1625 cut-off events. For 2246/4844 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 13230 event pairs, 109 based on Foata normal form. 525/2030 useless extension candidates. Maximal degree in co-relation 5995. Up to 1141 conditions per place. [2021-06-10 20:55:04,066 INFO L132 encePairwiseOnDemand]: 218/225 looper letters, 10 selfloop transitions, 18 changer transitions 0/69 dead transitions. [2021-06-10 20:55:04,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 69 transitions, 479 flow [2021-06-10 20:55:04,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 20:55:04,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 20:55:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1304 transitions. [2021-06-10 20:55:04,069 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.827936507936508 [2021-06-10 20:55:04,069 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1304 transitions. [2021-06-10 20:55:04,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1304 transitions. [2021-06-10 20:55:04,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:55:04,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1304 transitions. [2021-06-10 20:55:04,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 186.28571428571428) internal successors, (1304), 7 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:04,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 225.0) internal successors, (1800), 8 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:04,073 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 225.0) internal successors, (1800), 8 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:04,073 INFO L185 Difference]: Start difference. First operand has 58 places, 56 transitions, 347 flow. Second operand 7 states and 1304 transitions. [2021-06-10 20:55:04,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 69 transitions, 479 flow [2021-06-10 20:55:04,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 69 transitions, 479 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-10 20:55:04,081 INFO L241 Difference]: Finished difference. Result has 67 places, 65 transitions, 478 flow [2021-06-10 20:55:04,081 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=478, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2021-06-10 20:55:04,082 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2021-06-10 20:55:04,082 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 478 flow [2021-06-10 20:55:04,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 182.8) internal successors, (914), 5 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:04,082 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:55:04,082 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] [2021-06-10 20:55:04,082 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-10 20:55:04,082 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:55:04,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:55:04,082 INFO L82 PathProgramCache]: Analyzing trace with hash -650928126, now seen corresponding path program 1 times [2021-06-10 20:55:04,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:55:04,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637853156] [2021-06-10 20:55:04,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:55:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:55:04,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:04,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:04,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:04,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:04,177 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-06-10 20:55:04,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-10 20:55:04,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:04,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:04,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:04,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:55:04,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637853156] [2021-06-10 20:55:04,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:55:04,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-10 20:55:04,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635860614] [2021-06-10 20:55:04,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 20:55:04,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:55:04,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 20:55:04,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-10 20:55:04,185 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 225 [2021-06-10 20:55:04,186 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 478 flow. Second operand has 6 states, 6 states have (on average 182.83333333333334) internal successors, (1097), 6 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:04,186 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:55:04,186 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 225 [2021-06-10 20:55:04,217 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:55:04,392 INFO L129 PetriNetUnfolder]: 580/1384 cut-off events. [2021-06-10 20:55:04,392 INFO L130 PetriNetUnfolder]: For 5475/10955 co-relation queries the response was YES. [2021-06-10 20:55:04,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7135 conditions, 1384 events. 580/1384 cut-off events. For 5475/10955 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 11186 event pairs, 17 based on Foata normal form. 810/2094 useless extension candidates. Maximal degree in co-relation 7107. Up to 1043 conditions per place. [2021-06-10 20:55:04,404 INFO L132 encePairwiseOnDemand]: 218/225 looper letters, 6 selfloop transitions, 27 changer transitions 4/78 dead transitions. [2021-06-10 20:55:04,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 78 transitions, 678 flow [2021-06-10 20:55:04,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 20:55:04,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 20:55:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1677 transitions. [2021-06-10 20:55:04,407 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8281481481481482 [2021-06-10 20:55:04,407 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1677 transitions. [2021-06-10 20:55:04,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1677 transitions. [2021-06-10 20:55:04,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:55:04,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1677 transitions. [2021-06-10 20:55:04,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 186.33333333333334) internal successors, (1677), 9 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-06-10 20:55:04,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 225.0) internal successors, (2250), 10 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:04,413 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 225.0) internal successors, (2250), 10 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:04,414 INFO L185 Difference]: Start difference. First operand has 67 places, 65 transitions, 478 flow. Second operand 9 states and 1677 transitions. [2021-06-10 20:55:04,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 78 transitions, 678 flow [2021-06-10 20:55:04,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 78 transitions, 629 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-06-10 20:55:04,431 INFO L241 Difference]: Finished difference. Result has 75 places, 74 transitions, 605 flow [2021-06-10 20:55:04,431 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=605, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2021-06-10 20:55:04,432 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 27 predicate places. [2021-06-10 20:55:04,432 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 605 flow [2021-06-10 20:55:04,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 182.83333333333334) internal successors, (1097), 6 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:04,432 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:55:04,432 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-06-10 20:55:04,432 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-10 20:55:04,432 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:55:04,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:55:04,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2028282044, now seen corresponding path program 1 times [2021-06-10 20:55:04,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:55:04,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765267064] [2021-06-10 20:55:04,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:55:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:55:04,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:04,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:04,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:04,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:04,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:04,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:04,554 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-06-10 20:55:04,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-10 20:55:04,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:04,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:04,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:04,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:04,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:55:04,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765267064] [2021-06-10 20:55:04,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:55:04,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 20:55:04,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352344509] [2021-06-10 20:55:04,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 20:55:04,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:55:04,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 20:55:04,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-10 20:55:04,566 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 225 [2021-06-10 20:55:04,567 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 605 flow. Second operand has 7 states, 7 states have (on average 182.85714285714286) internal successors, (1280), 7 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:04,567 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:55:04,567 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 225 [2021-06-10 20:55:04,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:55:04,744 INFO L129 PetriNetUnfolder]: 521/1273 cut-off events. [2021-06-10 20:55:04,744 INFO L130 PetriNetUnfolder]: For 7581/12229 co-relation queries the response was YES. [2021-06-10 20:55:04,751 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6989 conditions, 1273 events. 521/1273 cut-off events. For 7581/12229 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 10446 event pairs, 7 based on Foata normal form. 670/1844 useless extension candidates. Maximal degree in co-relation 6958. Up to 679 conditions per place. [2021-06-10 20:55:04,756 INFO L132 encePairwiseOnDemand]: 218/225 looper letters, 2 selfloop transitions, 32 changer transitions 4/79 dead transitions. [2021-06-10 20:55:04,757 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 79 transitions, 737 flow [2021-06-10 20:55:04,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-10 20:55:04,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-10 20:55:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2042 transitions. [2021-06-10 20:55:04,760 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.825050505050505 [2021-06-10 20:55:04,760 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2042 transitions. [2021-06-10 20:55:04,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2042 transitions. [2021-06-10 20:55:04,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:55:04,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2042 transitions. [2021-06-10 20:55:04,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 185.63636363636363) internal successors, (2042), 11 states have internal predecessors, (2042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:04,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 225.0) internal successors, (2700), 12 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:04,768 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 225.0) internal successors, (2700), 12 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:04,768 INFO L185 Difference]: Start difference. First operand has 75 places, 74 transitions, 605 flow. Second operand 11 states and 2042 transitions. [2021-06-10 20:55:04,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 79 transitions, 737 flow [2021-06-10 20:55:04,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 79 transitions, 634 flow, removed 36 selfloop flow, removed 5 redundant places. [2021-06-10 20:55:04,812 INFO L241 Difference]: Finished difference. Result has 83 places, 75 transitions, 594 flow [2021-06-10 20:55:04,812 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=594, PETRI_PLACES=83, PETRI_TRANSITIONS=75} [2021-06-10 20:55:04,812 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 35 predicate places. [2021-06-10 20:55:04,812 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 594 flow [2021-06-10 20:55:04,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 182.85714285714286) internal successors, (1280), 7 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:04,813 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:55:04,813 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-06-10 20:55:04,813 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-10 20:55:04,813 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:55:04,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:55:04,814 INFO L82 PathProgramCache]: Analyzing trace with hash 940675989, now seen corresponding path program 1 times [2021-06-10 20:55:04,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:55:04,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491917882] [2021-06-10 20:55:04,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:55:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:55:04,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:04,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:55:04,878 INFO L142 QuantifierPusher]: treesize reduction 2, result has 93.5 percent of original size [2021-06-10 20:55:04,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-06-10 20:55:04,900 INFO L142 QuantifierPusher]: treesize reduction 2, result has 92.9 percent of original size [2021-06-10 20:55:04,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-06-10 20:55:04,921 INFO L142 QuantifierPusher]: treesize reduction 9, result has 73.5 percent of original size [2021-06-10 20:55:04,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-10 20:55:04,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:04,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-10 20:55:04,956 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-06-10 20:55:04,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-10 20:55:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:55:04,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491917882] [2021-06-10 20:55:04,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:55:04,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 20:55:04,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455420322] [2021-06-10 20:55:04,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-10 20:55:04,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:55:04,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-10 20:55:04,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-10 20:55:04,963 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 225 [2021-06-10 20:55:04,964 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 594 flow. Second operand has 8 states, 8 states have (on average 163.125) internal successors, (1305), 8 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:04,964 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:55:04,964 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 225 [2021-06-10 20:55:04,964 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:55:05,775 INFO L129 PetriNetUnfolder]: 2841/6756 cut-off events. [2021-06-10 20:55:05,775 INFO L130 PetriNetUnfolder]: For 26340/30641 co-relation queries the response was YES. [2021-06-10 20:55:05,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27338 conditions, 6756 events. 2841/6756 cut-off events. For 26340/30641 co-relation queries the response was YES. Maximal size of possible extension queue 1193. Compared 74120 event pairs, 88 based on Foata normal form. 489/6578 useless extension candidates. Maximal degree in co-relation 27304. Up to 1730 conditions per place. [2021-06-10 20:55:05,840 INFO L132 encePairwiseOnDemand]: 216/225 looper letters, 20 selfloop transitions, 13 changer transitions 3/100 dead transitions. [2021-06-10 20:55:05,840 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 100 transitions, 780 flow [2021-06-10 20:55:05,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 20:55:05,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 20:55:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1166 transitions. [2021-06-10 20:55:05,843 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7403174603174603 [2021-06-10 20:55:05,843 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1166 transitions. [2021-06-10 20:55:05,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1166 transitions. [2021-06-10 20:55:05,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:55:05,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1166 transitions. [2021-06-10 20:55:05,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 166.57142857142858) internal successors, (1166), 7 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:05,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 225.0) internal successors, (1800), 8 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:05,848 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 225.0) internal successors, (1800), 8 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:05,848 INFO L185 Difference]: Start difference. First operand has 83 places, 75 transitions, 594 flow. Second operand 7 states and 1166 transitions. [2021-06-10 20:55:05,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 100 transitions, 780 flow [2021-06-10 20:55:06,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 100 transitions, 659 flow, removed 31 selfloop flow, removed 10 redundant places. [2021-06-10 20:55:06,580 INFO L241 Difference]: Finished difference. Result has 82 places, 85 transitions, 595 flow [2021-06-10 20:55:06,580 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=595, PETRI_PLACES=82, PETRI_TRANSITIONS=85} [2021-06-10 20:55:06,580 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 34 predicate places. [2021-06-10 20:55:06,580 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 85 transitions, 595 flow [2021-06-10 20:55:06,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 163.125) internal successors, (1305), 8 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:06,581 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:55:06,581 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-06-10 20:55:06,581 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-10 20:55:06,581 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:55:06,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:55:06,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1776653425, now seen corresponding path program 2 times [2021-06-10 20:55:06,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:55:06,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327511769] [2021-06-10 20:55:06,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:55:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:55:06,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:06,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 20:55:06,649 INFO L142 QuantifierPusher]: treesize reduction 3, result has 92.1 percent of original size [2021-06-10 20:55:06,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-06-10 20:55:06,700 INFO L142 QuantifierPusher]: treesize reduction 10, result has 77.3 percent of original size [2021-06-10 20:55:06,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-10 20:55:06,726 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-06-10 20:55:06,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-10 20:55:06,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:06,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 20:55:06,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:06,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:06,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:55:06,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327511769] [2021-06-10 20:55:06,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:55:06,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 20:55:06,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534659929] [2021-06-10 20:55:06,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-10 20:55:06,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:55:06,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-10 20:55:06,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-10 20:55:06,766 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 225 [2021-06-10 20:55:06,767 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 85 transitions, 595 flow. Second operand has 8 states, 8 states have (on average 162.125) internal successors, (1297), 8 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:06,767 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:55:06,767 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 225 [2021-06-10 20:55:06,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:55:07,474 INFO L129 PetriNetUnfolder]: 3066/7332 cut-off events. [2021-06-10 20:55:07,474 INFO L130 PetriNetUnfolder]: For 19151/22217 co-relation queries the response was YES. [2021-06-10 20:55:07,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26577 conditions, 7332 events. 3066/7332 cut-off events. For 19151/22217 co-relation queries the response was YES. Maximal size of possible extension queue 1255. Compared 81522 event pairs, 113 based on Foata normal form. 637/7314 useless extension candidates. Maximal degree in co-relation 26542. Up to 1899 conditions per place. [2021-06-10 20:55:07,533 INFO L132 encePairwiseOnDemand]: 220/225 looper letters, 24 selfloop transitions, 8 changer transitions 1/97 dead transitions. [2021-06-10 20:55:07,534 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 97 transitions, 745 flow [2021-06-10 20:55:07,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-10 20:55:07,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-10 20:55:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 988 transitions. [2021-06-10 20:55:07,536 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7318518518518519 [2021-06-10 20:55:07,536 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 988 transitions. [2021-06-10 20:55:07,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 988 transitions. [2021-06-10 20:55:07,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:55:07,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 988 transitions. [2021-06-10 20:55:07,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 164.66666666666666) internal successors, (988), 6 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:07,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:07,539 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:07,540 INFO L185 Difference]: Start difference. First operand has 82 places, 85 transitions, 595 flow. Second operand 6 states and 988 transitions. [2021-06-10 20:55:07,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 97 transitions, 745 flow [2021-06-10 20:55:08,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 97 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 20:55:08,524 INFO L241 Difference]: Finished difference. Result has 87 places, 87 transitions, 636 flow [2021-06-10 20:55:08,524 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=636, PETRI_PLACES=87, PETRI_TRANSITIONS=87} [2021-06-10 20:55:08,524 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 39 predicate places. [2021-06-10 20:55:08,524 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 87 transitions, 636 flow [2021-06-10 20:55:08,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 162.125) internal successors, (1297), 8 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:08,524 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:55:08,525 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-06-10 20:55:08,525 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-10 20:55:08,525 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:55:08,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:55:08,525 INFO L82 PathProgramCache]: Analyzing trace with hash -91208275, now seen corresponding path program 3 times [2021-06-10 20:55:08,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:55:08,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310105740] [2021-06-10 20:55:08,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:55:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 20:55:08,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:08,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 20:55:08,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:08,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:08,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 20:55:08,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 20:55:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 20:55:08,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310105740] [2021-06-10 20:55:08,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 20:55:08,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 20:55:08,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760625455] [2021-06-10 20:55:08,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 20:55:08,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 20:55:08,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 20:55:08,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-10 20:55:08,579 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 225 [2021-06-10 20:55:08,579 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 87 transitions, 636 flow. Second operand has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:08,579 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 20:55:08,579 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 225 [2021-06-10 20:55:08,580 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 20:55:09,341 INFO L129 PetriNetUnfolder]: 4792/10679 cut-off events. [2021-06-10 20:55:09,341 INFO L130 PetriNetUnfolder]: For 23412/26099 co-relation queries the response was YES. [2021-06-10 20:55:09,389 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38153 conditions, 10679 events. 4792/10679 cut-off events. For 23412/26099 co-relation queries the response was YES. Maximal size of possible extension queue 1937. Compared 119980 event pairs, 144 based on Foata normal form. 357/9789 useless extension candidates. Maximal degree in co-relation 38116. Up to 2957 conditions per place. [2021-06-10 20:55:09,402 INFO L132 encePairwiseOnDemand]: 222/225 looper letters, 6 selfloop transitions, 3 changer transitions 6/91 dead transitions. [2021-06-10 20:55:09,402 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 91 transitions, 693 flow [2021-06-10 20:55:09,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-10 20:55:09,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-10 20:55:09,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 750 transitions. [2021-06-10 20:55:09,404 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2021-06-10 20:55:09,404 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 750 transitions. [2021-06-10 20:55:09,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 750 transitions. [2021-06-10 20:55:09,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 20:55:09,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 750 transitions. [2021-06-10 20:55:09,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 187.5) internal successors, (750), 4 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:09,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:09,406 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 225.0) internal successors, (1125), 5 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:09,406 INFO L185 Difference]: Start difference. First operand has 87 places, 87 transitions, 636 flow. Second operand 4 states and 750 transitions. [2021-06-10 20:55:09,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 91 transitions, 693 flow [2021-06-10 20:55:11,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 91 transitions, 683 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-06-10 20:55:11,295 INFO L241 Difference]: Finished difference. Result has 88 places, 85 transitions, 620 flow [2021-06-10 20:55:11,295 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=620, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2021-06-10 20:55:11,296 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 40 predicate places. [2021-06-10 20:55:11,296 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 620 flow [2021-06-10 20:55:11,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 20:55:11,296 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 20:55:11,296 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-06-10 20:55:11,297 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-10 20:55:11,297 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 20:55:11,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 20:55:11,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1302684139, now seen corresponding path program 4 times [2021-06-10 20:55:11,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 20:55:11,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076676897] [2021-06-10 20:55:11,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 20:55:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 20:55:11,334 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 20:55:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 20:55:11,374 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 20:55:11,400 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 20:55:11,400 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 20:55:11,400 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-10 20:55:11,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 08:55:11 BasicIcfg [2021-06-10 20:55:11,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-10 20:55:11,487 INFO L168 Benchmark]: Toolchain (without parser) took 16609.26 ms. Allocated memory was 371.2 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 334.6 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 371.7 MB. Max. memory is 16.0 GB. [2021-06-10 20:55:11,487 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 371.2 MB. Free memory was 352.8 MB in the beginning and 352.7 MB in the end (delta: 71.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-10 20:55:11,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 416.12 ms. Allocated memory is still 371.2 MB. Free memory was 334.4 MB in the beginning and 328.6 MB in the end (delta: 5.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 16.0 GB. [2021-06-10 20:55:11,487 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.07 ms. Allocated memory is still 371.2 MB. Free memory was 328.6 MB in the beginning and 326.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 20:55:11,488 INFO L168 Benchmark]: Boogie Preprocessor took 49.18 ms. Allocated memory is still 371.2 MB. Free memory was 326.5 MB in the beginning and 323.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-10 20:55:11,488 INFO L168 Benchmark]: RCFGBuilder took 1595.42 ms. Allocated memory is still 371.2 MB. Free memory was 323.3 MB in the beginning and 249.4 MB in the end (delta: 73.9 MB). Peak memory consumption was 151.0 MB. Max. memory is 16.0 GB. [2021-06-10 20:55:11,488 INFO L168 Benchmark]: TraceAbstraction took 14513.63 ms. Allocated memory was 371.2 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 248.4 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 282.7 MB. Max. memory is 16.0 GB. [2021-06-10 20:55:11,489 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.10 ms. Allocated memory is still 371.2 MB. Free memory was 352.8 MB in the beginning and 352.7 MB in the end (delta: 71.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 416.12 ms. Allocated memory is still 371.2 MB. Free memory was 334.4 MB in the beginning and 328.6 MB in the end (delta: 5.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 31.07 ms. Allocated memory is still 371.2 MB. Free memory was 328.6 MB in the beginning and 326.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 49.18 ms. Allocated memory is still 371.2 MB. Free memory was 326.5 MB in the beginning and 323.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1595.42 ms. Allocated memory is still 371.2 MB. Free memory was 323.3 MB in the beginning and 249.4 MB in the end (delta: 73.9 MB). Peak memory consumption was 151.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 14513.63 ms. Allocated memory was 371.2 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 248.4 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 282.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5600.6ms, 127 PlacesBefore, 48 PlacesAfterwards, 116 TransitionsBefore, 36 TransitionsAfterwards, 2876 CoEnabledTransitionPairs, 8 FixpointIterations, 42 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 9088 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3894, positive: 3664, positive conditional: 0, positive unconditional: 3664, negative: 230, negative conditional: 0, negative unconditional: 230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2050, positive: 1985, positive conditional: 0, positive unconditional: 1985, negative: 65, negative conditional: 0, negative unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2050, positive: 1985, positive conditional: 0, positive unconditional: 1985, negative: 65, negative conditional: 0, negative unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2050, positive: 1951, positive conditional: 0, positive unconditional: 1951, negative: 99, negative conditional: 0, negative unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 99, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 65, negative conditional: 0, negative unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 699, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 628, negative conditional: 0, negative unconditional: 628, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3894, positive: 1679, positive conditional: 0, positive unconditional: 1679, negative: 165, negative conditional: 0, negative unconditional: 165, unknown: 2050, unknown conditional: 0, unknown unconditional: 2050] , Statistics on independence cache: Total cache size (in pairs): 3588, Positive cache size: 3524, Positive conditional cache size: 0, Positive unconditional cache size: 3524, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64 - 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; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1041; [L872] FCALL, FORK 0 pthread_create(&t1041, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1042; [L874] FCALL, FORK 0 pthread_create(&t1042, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L875] 0 pthread_t t1043; [L876] FCALL, FORK 0 pthread_create(&t1043, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L810] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L790] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L877] 0 pthread_t t1044; [L878] FCALL, FORK 0 pthread_create(&t1044, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_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=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_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=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L849] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L884] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_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, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 14307.2ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 7336.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5681.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 65 SDtfs, 41 SDslu, 36 SDs, 0 SdLazy, 399 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 346.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 362.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=636occurred in iteration=11, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 38.3ms SsaConstructionTime, 367.2ms SatisfiabilityAnalysisTime, 693.8ms InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 1407 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...