/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/rfi007_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-10 21:04:32,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-10 21:04:32,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-10 21:04:32,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-10 21:04:32,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-10 21:04:32,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-10 21:04:32,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-10 21:04:32,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-10 21:04:32,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-10 21:04:32,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-10 21:04:32,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-10 21:04:32,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-10 21:04:32,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-10 21:04:32,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-10 21:04:32,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-10 21:04:32,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-10 21:04:32,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-10 21:04:32,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-10 21:04:32,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-10 21:04:32,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-10 21:04:32,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-10 21:04:32,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-10 21:04:32,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-10 21:04:32,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-10 21:04:32,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-10 21:04:32,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-10 21:04:32,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-10 21:04:32,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-10 21:04:32,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-10 21:04:32,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-10 21:04:32,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-10 21:04:32,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-10 21:04:32,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-10 21:04:32,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-10 21:04:32,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-10 21:04:32,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-10 21:04:32,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-10 21:04:32,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-10 21:04:32,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-10 21:04:32,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-10 21:04:32,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-10 21:04:32,104 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 21:04:32,144 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-10 21:04:32,144 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-10 21:04:32,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-10 21:04:32,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-10 21:04:32,147 INFO L138 SettingsManager]: * Use SBE=true [2021-06-10 21:04:32,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-10 21:04:32,147 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-10 21:04:32,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-10 21:04:32,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-10 21:04:32,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-10 21:04:32,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-10 21:04:32,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-10 21:04:32,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-10 21:04:32,149 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-10 21:04:32,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-10 21:04:32,149 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-10 21:04:32,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-10 21:04:32,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-10 21:04:32,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-10 21:04:32,149 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-10 21:04:32,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-10 21:04:32,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 21:04:32,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-10 21:04:32,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-10 21:04:32,150 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-10 21:04:32,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-10 21:04:32,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-10 21:04:32,151 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-10 21:04:32,151 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 21:04:32,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-10 21:04:32,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-10 21:04:32,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-10 21:04:32,473 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-10 21:04:32,474 INFO L275 PluginConnector]: CDTParser initialized [2021-06-10 21:04:32,474 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc.i [2021-06-10 21:04:32,532 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6af23291/1b7c3f4834104bb69316e728bf05cfca/FLAG0cad1201b [2021-06-10 21:04:33,085 INFO L306 CDTParser]: Found 1 translation units. [2021-06-10 21:04:33,086 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc.i [2021-06-10 21:04:33,108 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6af23291/1b7c3f4834104bb69316e728bf05cfca/FLAG0cad1201b [2021-06-10 21:04:33,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6af23291/1b7c3f4834104bb69316e728bf05cfca [2021-06-10 21:04:33,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-10 21:04:33,543 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-10 21:04:33,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-10 21:04:33,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-10 21:04:33,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-10 21:04:33,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 09:04:33" (1/1) ... [2021-06-10 21:04:33,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51a2a34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:04:33, skipping insertion in model container [2021-06-10 21:04:33,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 09:04:33" (1/1) ... [2021-06-10 21:04:33,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-10 21:04:33,610 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-10 21:04:33,809 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/rfi007_power.oepc.i[951,964] [2021-06-10 21:04:34,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 21:04:34,029 INFO L203 MainTranslator]: Completed pre-run [2021-06-10 21:04:34,040 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/rfi007_power.oepc.i[951,964] [2021-06-10 21:04:34,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 21:04:34,161 INFO L208 MainTranslator]: Completed translation [2021-06-10 21:04:34,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:04:34 WrapperNode [2021-06-10 21:04:34,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-10 21:04:34,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-10 21:04:34,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-10 21:04:34,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-10 21:04:34,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:04:34" (1/1) ... [2021-06-10 21:04:34,204 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:04:34" (1/1) ... [2021-06-10 21:04:34,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-10 21:04:34,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-10 21:04:34,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-10 21:04:34,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-10 21:04:34,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:04:34" (1/1) ... [2021-06-10 21:04:34,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:04:34" (1/1) ... [2021-06-10 21:04:34,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:04:34" (1/1) ... [2021-06-10 21:04:34,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:04:34" (1/1) ... [2021-06-10 21:04:34,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:04:34" (1/1) ... [2021-06-10 21:04:34,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:04:34" (1/1) ... [2021-06-10 21:04:34,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:04:34" (1/1) ... [2021-06-10 21:04:34,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-10 21:04:34,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-10 21:04:34,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-10 21:04:34,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-10 21:04:34,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:04:34" (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 21:04:34,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-10 21:04:34,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-10 21:04:34,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-10 21:04:34,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-10 21:04:34,357 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-10 21:04:34,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-10 21:04:34,358 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-10 21:04:34,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-10 21:04:34,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-10 21:04:34,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-10 21:04:34,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-10 21:04:34,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-10 21:04:34,361 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 21:04:36,188 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-10 21:04:36,188 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-10 21:04:36,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 09:04:36 BoogieIcfgContainer [2021-06-10 21:04:36,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-10 21:04:36,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-10 21:04:36,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-10 21:04:36,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-10 21:04:36,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 09:04:33" (1/3) ... [2021-06-10 21:04:36,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385f4120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 09:04:36, skipping insertion in model container [2021-06-10 21:04:36,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:04:34" (2/3) ... [2021-06-10 21:04:36,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385f4120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 09:04:36, skipping insertion in model container [2021-06-10 21:04:36,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 09:04:36" (3/3) ... [2021-06-10 21:04:36,197 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc.i [2021-06-10 21:04:36,203 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-10 21:04:36,207 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-10 21:04:36,208 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-10 21:04:36,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,245 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,245 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,245 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,245 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,245 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,245 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,245 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,245 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,246 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,246 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,246 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,251 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,251 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,251 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,252 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,252 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,252 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,264 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,267 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,268 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,268 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,268 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,285 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,285 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,285 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,289 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,291 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:04:36,293 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 21:04:36,310 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-10 21:04:36,337 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 21:04:36,337 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 21:04:36,338 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 21:04:36,338 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 21:04:36,338 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 21:04:36,338 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 21:04:36,338 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 21:04:36,338 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 21:04:36,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 82 transitions, 174 flow [2021-06-10 21:04:36,388 INFO L129 PetriNetUnfolder]: 2/80 cut-off events. [2021-06-10 21:04:36,389 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:04:36,396 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 80 events. 2/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-06-10 21:04:36,396 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 82 transitions, 174 flow [2021-06-10 21:04:36,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 80 transitions, 166 flow [2021-06-10 21:04:36,403 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 21:04:36,415 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 80 transitions, 166 flow [2021-06-10 21:04:36,418 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 80 transitions, 166 flow [2021-06-10 21:04:36,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 166 flow [2021-06-10 21:04:36,443 INFO L129 PetriNetUnfolder]: 2/80 cut-off events. [2021-06-10 21:04:36,444 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:04:36,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 80 events. 2/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-06-10 21:04:36,448 INFO L151 LiptonReduction]: Number of co-enabled transitions 992 [2021-06-10 21:04:36,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:36,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:36,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:36,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:36,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:36,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:36,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:36,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:36,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:36,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:36,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:36,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:36,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:36,817 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-10 21:04:36,817 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:04:36,842 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:36,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,150 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:04:37,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:04:37,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:04:37,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,595 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:04:37,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:04:37,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:04:37,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,730 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-10 21:04:37,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:37,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:37,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:38,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:38,138 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:04:38,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:38,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:04:38,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:04:38,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:38,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:38,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:38,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:38,398 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-10 21:04:38,852 WARN L205 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-10 21:04:38,991 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-10 21:04:39,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:39,020 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:04:39,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:39,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-10 21:04:39,037 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:04:39,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:39,044 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-10 21:04:39,044 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:04:39,053 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:39,057 INFO L147 QuantifierPusher]: treesize reduction 50, result has 50.0 percent of original size 50 [2021-06-10 21:04:39,057 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:04:39,060 INFO L142 QuantifierPusher]: treesize reduction 50, result has 68.8 percent of original size [2021-06-10 21:04:39,061 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 1] term [2021-06-10 21:04:39,061 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:04:39,063 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:39,065 INFO L147 QuantifierPusher]: treesize reduction 76, result has 39.7 percent of original size 50 [2021-06-10 21:04:39,066 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 3, 2, 1] term [2021-06-10 21:04:39,066 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:04:39,069 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:39,080 INFO L147 QuantifierPusher]: treesize reduction 141, result has 44.3 percent of original size 112 [2021-06-10 21:04:39,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:39,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:39,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:39,249 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:04:39,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:39,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:04:39,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:04:39,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:39,330 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:04:39,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:39,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 21:04:39,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-10 21:04:39,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:39,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:39,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:39,545 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-10 21:04:39,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:39,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:39,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:39,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:39,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:39,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:39,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:39,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:40,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:40,165 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:04:40,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:40,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:04:40,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:04:40,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:40,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:40,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:40,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:40,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:40,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:40,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:40,599 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:04:40,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:40,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:04:40,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:04:40,973 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-06-10 21:04:41,092 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-10 21:04:41,356 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-06-10 21:04:41,478 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-10 21:04:41,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:41,503 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:04:41,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:41,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:04:41,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:04:41,526 INFO L163 LiptonReduction]: Checked pairs total: 2978 [2021-06-10 21:04:41,526 INFO L165 LiptonReduction]: Total number of compositions: 82 [2021-06-10 21:04:41,528 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5126 [2021-06-10 21:04:41,534 INFO L129 PetriNetUnfolder]: 0/3 cut-off events. [2021-06-10 21:04:41,534 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:04:41,534 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:04:41,535 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-06-10 21:04:41,535 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:04:41,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:04:41,539 INFO L82 PathProgramCache]: Analyzing trace with hash 927832, now seen corresponding path program 1 times [2021-06-10 21:04:41,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:04:41,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061025217] [2021-06-10 21:04:41,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:04:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:04:41,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:41,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:04:41,698 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 21:04:41,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061025217] [2021-06-10 21:04:41,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:04:41,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 21:04:41,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999615571] [2021-06-10 21:04:41,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 21:04:41,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:04:41,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 21:04:41,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 21:04:41,717 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 164 [2021-06-10 21:04:41,722 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 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 21:04:41,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:04:41,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 164 [2021-06-10 21:04:41,723 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:04:41,764 INFO L129 PetriNetUnfolder]: 16/60 cut-off events. [2021-06-10 21:04:41,764 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:04:41,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 60 events. 16/60 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 213 event pairs, 2 based on Foata normal form. 18/72 useless extension candidates. Maximal degree in co-relation 93. Up to 27 conditions per place. [2021-06-10 21:04:41,766 INFO L132 encePairwiseOnDemand]: 159/164 looper letters, 7 selfloop transitions, 2 changer transitions 1/22 dead transitions. [2021-06-10 21:04:41,766 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 22 transitions, 68 flow [2021-06-10 21:04:41,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 21:04:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 21:04:41,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2021-06-10 21:04:41,776 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8211382113821138 [2021-06-10 21:04:41,777 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2021-06-10 21:04:41,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2021-06-10 21:04:41,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:04:41,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2021-06-10 21:04:41,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 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 21:04:41,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 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 21:04:41,789 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 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 21:04:41,790 INFO L185 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 3 states and 404 transitions. [2021-06-10 21:04:41,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 22 transitions, 68 flow [2021-06-10 21:04:41,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 22 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 21:04:41,793 INFO L241 Difference]: Finished difference. Result has 26 places, 18 transitions, 44 flow [2021-06-10 21:04:41,795 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2021-06-10 21:04:41,795 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2021-06-10 21:04:41,795 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 44 flow [2021-06-10 21:04:41,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 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 21:04:41,796 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:04:41,796 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:04:41,796 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-10 21:04:41,796 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:04:41,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:04:41,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2068804648, now seen corresponding path program 1 times [2021-06-10 21:04:41,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:04:41,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300054223] [2021-06-10 21:04:41,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:04:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:04:41,859 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-06-10 21:04:41,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:04:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:04:41,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300054223] [2021-06-10 21:04:41,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:04:41,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 21:04:41,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107692669] [2021-06-10 21:04:41,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 21:04:41,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:04:41,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 21:04:41,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 21:04:41,869 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 164 [2021-06-10 21:04:41,870 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 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 21:04:41,870 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:04:41,870 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 164 [2021-06-10 21:04:41,870 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:04:41,905 INFO L129 PetriNetUnfolder]: 22/97 cut-off events. [2021-06-10 21:04:41,905 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:04:41,906 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 97 events. 22/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 461 event pairs, 8 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 153. Up to 31 conditions per place. [2021-06-10 21:04:41,906 INFO L132 encePairwiseOnDemand]: 157/164 looper letters, 4 selfloop transitions, 5 changer transitions 2/22 dead transitions. [2021-06-10 21:04:41,906 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 74 flow [2021-06-10 21:04:41,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 21:04:41,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 21:04:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2021-06-10 21:04:41,909 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.774390243902439 [2021-06-10 21:04:41,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2021-06-10 21:04:41,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2021-06-10 21:04:41,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:04:41,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2021-06-10 21:04:41,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 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 21:04:41,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 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 21:04:41,912 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 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 21:04:41,912 INFO L185 Difference]: Start difference. First operand has 26 places, 18 transitions, 44 flow. Second operand 3 states and 381 transitions. [2021-06-10 21:04:41,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 74 flow [2021-06-10 21:04:41,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 22 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 21:04:41,913 INFO L241 Difference]: Finished difference. Result has 27 places, 20 transitions, 72 flow [2021-06-10 21:04:41,913 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2021-06-10 21:04:41,914 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, -1 predicate places. [2021-06-10 21:04:41,914 INFO L480 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 72 flow [2021-06-10 21:04:41,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 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 21:04:41,914 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:04:41,914 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:04:41,914 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-10 21:04:41,915 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:04:41,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:04:41,915 INFO L82 PathProgramCache]: Analyzing trace with hash 290072237, now seen corresponding path program 1 times [2021-06-10 21:04:41,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:04:41,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561200394] [2021-06-10 21:04:41,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:04:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:04:41,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:41,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:04:41,996 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 21:04:41,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561200394] [2021-06-10 21:04:41,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:04:41,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 21:04:41,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871664189] [2021-06-10 21:04:41,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 21:04:41,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:04:41,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 21:04:41,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 21:04:41,999 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 164 [2021-06-10 21:04:41,999 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 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 21:04:41,999 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:04:41,999 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 164 [2021-06-10 21:04:41,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:04:42,010 INFO L129 PetriNetUnfolder]: 5/45 cut-off events. [2021-06-10 21:04:42,010 INFO L130 PetriNetUnfolder]: For 12/14 co-relation queries the response was YES. [2021-06-10 21:04:42,010 INFO L84 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 45 events. 5/45 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 2 based on Foata normal form. 2/45 useless extension candidates. Maximal degree in co-relation 83. Up to 16 conditions per place. [2021-06-10 21:04:42,010 INFO L132 encePairwiseOnDemand]: 161/164 looper letters, 1 selfloop transitions, 3 changer transitions 0/20 dead transitions. [2021-06-10 21:04:42,010 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 80 flow [2021-06-10 21:04:42,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 21:04:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 21:04:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2021-06-10 21:04:42,012 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8252032520325203 [2021-06-10 21:04:42,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2021-06-10 21:04:42,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2021-06-10 21:04:42,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:04:42,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2021-06-10 21:04:42,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 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 21:04:42,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 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 21:04:42,015 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 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 21:04:42,015 INFO L185 Difference]: Start difference. First operand has 27 places, 20 transitions, 72 flow. Second operand 3 states and 406 transitions. [2021-06-10 21:04:42,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 80 flow [2021-06-10 21:04:42,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 21:04:42,016 INFO L241 Difference]: Finished difference. Result has 27 places, 20 transitions, 73 flow [2021-06-10 21:04:42,017 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2021-06-10 21:04:42,017 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, -1 predicate places. [2021-06-10 21:04:42,017 INFO L480 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 73 flow [2021-06-10 21:04:42,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 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 21:04:42,017 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:04:42,017 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:04:42,017 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-10 21:04:42,018 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:04:42,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:04:42,018 INFO L82 PathProgramCache]: Analyzing trace with hash 448575293, now seen corresponding path program 1 times [2021-06-10 21:04:42,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:04:42,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873118970] [2021-06-10 21:04:42,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:04:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:04:42,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:42,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:04:42,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:42,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 21:04:42,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:42,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:42,063 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 21:04:42,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873118970] [2021-06-10 21:04:42,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:04:42,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 21:04:42,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409979061] [2021-06-10 21:04:42,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 21:04:42,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:04:42,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 21:04:42,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-10 21:04:42,066 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 164 [2021-06-10 21:04:42,066 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 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 21:04:42,066 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:04:42,066 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 164 [2021-06-10 21:04:42,066 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:04:42,109 INFO L129 PetriNetUnfolder]: 26/98 cut-off events. [2021-06-10 21:04:42,109 INFO L130 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2021-06-10 21:04:42,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 98 events. 26/98 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 434 event pairs, 6 based on Foata normal form. 9/88 useless extension candidates. Maximal degree in co-relation 194. Up to 37 conditions per place. [2021-06-10 21:04:42,110 INFO L132 encePairwiseOnDemand]: 158/164 looper letters, 4 selfloop transitions, 7 changer transitions 3/28 dead transitions. [2021-06-10 21:04:42,110 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 117 flow [2021-06-10 21:04:42,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 21:04:42,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 21:04:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2021-06-10 21:04:42,112 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.775609756097561 [2021-06-10 21:04:42,112 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2021-06-10 21:04:42,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2021-06-10 21:04:42,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:04:42,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2021-06-10 21:04:42,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 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 21:04:42,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 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 21:04:42,117 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 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 21:04:42,117 INFO L185 Difference]: Start difference. First operand has 27 places, 20 transitions, 73 flow. Second operand 5 states and 636 transitions. [2021-06-10 21:04:42,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 117 flow [2021-06-10 21:04:42,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 111 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 21:04:42,118 INFO L241 Difference]: Finished difference. Result has 32 places, 25 transitions, 113 flow [2021-06-10 21:04:42,118 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2021-06-10 21:04:42,119 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2021-06-10 21:04:42,119 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 113 flow [2021-06-10 21:04:42,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 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 21:04:42,119 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:04:42,119 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:04:42,119 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-10 21:04:42,120 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:04:42,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:04:42,120 INFO L82 PathProgramCache]: Analyzing trace with hash -452602470, now seen corresponding path program 1 times [2021-06-10 21:04:42,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:04:42,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125096480] [2021-06-10 21:04:42,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:04:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:04:42,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:42,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:04:42,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:42,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:04:42,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:42,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 21:04:42,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:42,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:42,207 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 21:04:42,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125096480] [2021-06-10 21:04:42,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:04:42,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:04:42,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663408324] [2021-06-10 21:04:42,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 21:04:42,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:04:42,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 21:04:42,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-10 21:04:42,209 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 164 [2021-06-10 21:04:42,210 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 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 21:04:42,210 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:04:42,210 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 164 [2021-06-10 21:04:42,210 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:04:42,270 INFO L129 PetriNetUnfolder]: 12/70 cut-off events. [2021-06-10 21:04:42,270 INFO L130 PetriNetUnfolder]: For 79/153 co-relation queries the response was YES. [2021-06-10 21:04:42,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 70 events. 12/70 cut-off events. For 79/153 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 267 event pairs, 0 based on Foata normal form. 26/89 useless extension candidates. Maximal degree in co-relation 205. Up to 25 conditions per place. [2021-06-10 21:04:42,272 INFO L132 encePairwiseOnDemand]: 158/164 looper letters, 2 selfloop transitions, 10 changer transitions 3/29 dead transitions. [2021-06-10 21:04:42,272 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 162 flow [2021-06-10 21:04:42,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 21:04:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 21:04:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 885 transitions. [2021-06-10 21:04:42,274 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7709059233449478 [2021-06-10 21:04:42,274 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 885 transitions. [2021-06-10 21:04:42,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 885 transitions. [2021-06-10 21:04:42,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:04:42,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 885 transitions. [2021-06-10 21:04:42,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.42857142857143) internal successors, (885), 7 states have internal predecessors, (885), 0 states have call successors, (0), 0 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 21:04:42,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 164.0) internal successors, (1312), 8 states have internal predecessors, (1312), 0 states have call successors, (0), 0 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 21:04:42,280 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 164.0) internal successors, (1312), 8 states have internal predecessors, (1312), 0 states have call successors, (0), 0 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 21:04:42,280 INFO L185 Difference]: Start difference. First operand has 32 places, 25 transitions, 113 flow. Second operand 7 states and 885 transitions. [2021-06-10 21:04:42,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 162 flow [2021-06-10 21:04:42,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 157 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-10 21:04:42,283 INFO L241 Difference]: Finished difference. Result has 40 places, 26 transitions, 147 flow [2021-06-10 21:04:42,283 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=147, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2021-06-10 21:04:42,284 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 12 predicate places. [2021-06-10 21:04:42,284 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 147 flow [2021-06-10 21:04:42,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 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 21:04:42,285 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:04:42,285 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:04:42,285 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-10 21:04:42,285 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:04:42,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:04:42,286 INFO L82 PathProgramCache]: Analyzing trace with hash 661539582, now seen corresponding path program 1 times [2021-06-10 21:04:42,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:04:42,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059490551] [2021-06-10 21:04:42,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:04:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:04:42,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:42,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:04:42,450 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-06-10 21:04:42,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 21:04:42,465 INFO L142 QuantifierPusher]: treesize reduction 24, result has 63.6 percent of original size [2021-06-10 21:04:42,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-10 21:04:42,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:04:42,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:04:42,486 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 21:04:42,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059490551] [2021-06-10 21:04:42,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:04:42,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:04:42,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570993773] [2021-06-10 21:04:42,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 21:04:42,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:04:42,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 21:04:42,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-10 21:04:42,489 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 164 [2021-06-10 21:04:42,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 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 21:04:42,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:04:42,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 164 [2021-06-10 21:04:42,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:04:42,635 INFO L129 PetriNetUnfolder]: 28/129 cut-off events. [2021-06-10 21:04:42,635 INFO L130 PetriNetUnfolder]: For 446/516 co-relation queries the response was YES. [2021-06-10 21:04:42,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 129 events. 28/129 cut-off events. For 446/516 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 636 event pairs, 1 based on Foata normal form. 32/151 useless extension candidates. Maximal degree in co-relation 436. Up to 44 conditions per place. [2021-06-10 21:04:42,636 INFO L132 encePairwiseOnDemand]: 154/164 looper letters, 7 selfloop transitions, 9 changer transitions 16/45 dead transitions. [2021-06-10 21:04:42,636 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 283 flow [2021-06-10 21:04:42,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 21:04:42,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 21:04:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 740 transitions. [2021-06-10 21:04:42,639 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6445993031358885 [2021-06-10 21:04:42,639 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 740 transitions. [2021-06-10 21:04:42,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 740 transitions. [2021-06-10 21:04:42,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:04:42,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 740 transitions. [2021-06-10 21:04:42,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.71428571428571) internal successors, (740), 7 states have internal predecessors, (740), 0 states have call successors, (0), 0 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 21:04:42,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 164.0) internal successors, (1312), 8 states have internal predecessors, (1312), 0 states have call successors, (0), 0 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 21:04:42,644 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 164.0) internal successors, (1312), 8 states have internal predecessors, (1312), 0 states have call successors, (0), 0 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 21:04:42,644 INFO L185 Difference]: Start difference. First operand has 40 places, 26 transitions, 147 flow. Second operand 7 states and 740 transitions. [2021-06-10 21:04:42,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 283 flow [2021-06-10 21:04:42,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 246 flow, removed 10 selfloop flow, removed 6 redundant places. [2021-06-10 21:04:42,647 INFO L241 Difference]: Finished difference. Result has 43 places, 28 transitions, 169 flow [2021-06-10 21:04:42,647 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=169, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2021-06-10 21:04:42,648 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 15 predicate places. [2021-06-10 21:04:42,648 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 169 flow [2021-06-10 21:04:42,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 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 21:04:42,648 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:04:42,648 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:04:42,648 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-10 21:04:42,648 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:04:42,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:04:42,649 INFO L82 PathProgramCache]: Analyzing trace with hash -388997378, now seen corresponding path program 2 times [2021-06-10 21:04:42,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:04:42,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001536490] [2021-06-10 21:04:42,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:04:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 21:04:42,687 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 21:04:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 21:04:42,719 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 21:04:42,741 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 21:04:42,742 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 21:04:42,742 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-10 21:04:42,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 09:04:42 BasicIcfg [2021-06-10 21:04:42,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-10 21:04:42,789 INFO L168 Benchmark]: Toolchain (without parser) took 9246.06 ms. Allocated memory was 379.6 MB in the beginning and 480.2 MB in the end (delta: 100.7 MB). Free memory was 341.9 MB in the beginning and 303.3 MB in the end (delta: 38.6 MB). Peak memory consumption was 140.7 MB. Max. memory is 16.0 GB. [2021-06-10 21:04:42,789 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 379.6 MB. Free memory was 360.2 MB in the beginning and 360.2 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-10 21:04:42,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 615.44 ms. Allocated memory is still 379.6 MB. Free memory was 341.8 MB in the beginning and 337.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.0 GB. [2021-06-10 21:04:42,790 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.92 ms. Allocated memory is still 379.6 MB. Free memory was 337.8 MB in the beginning and 335.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 21:04:42,790 INFO L168 Benchmark]: Boogie Preprocessor took 40.79 ms. Allocated memory is still 379.6 MB. Free memory was 335.8 MB in the beginning and 333.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 21:04:42,791 INFO L168 Benchmark]: RCFGBuilder took 1911.84 ms. Allocated memory is still 379.6 MB. Free memory was 333.7 MB in the beginning and 290.5 MB in the end (delta: 43.2 MB). Peak memory consumption was 141.8 MB. Max. memory is 16.0 GB. [2021-06-10 21:04:42,791 INFO L168 Benchmark]: TraceAbstraction took 6597.07 ms. Allocated memory was 379.6 MB in the beginning and 480.2 MB in the end (delta: 100.7 MB). Free memory was 290.5 MB in the beginning and 303.3 MB in the end (delta: -12.9 MB). Peak memory consumption was 87.8 MB. Max. memory is 16.0 GB. [2021-06-10 21:04:42,793 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 379.6 MB. Free memory was 360.2 MB in the beginning and 360.2 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 615.44 ms. Allocated memory is still 379.6 MB. Free memory was 341.8 MB in the beginning and 337.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 72.92 ms. Allocated memory is still 379.6 MB. Free memory was 337.8 MB in the beginning and 335.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 40.79 ms. Allocated memory is still 379.6 MB. Free memory was 335.8 MB in the beginning and 333.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1911.84 ms. Allocated memory is still 379.6 MB. Free memory was 333.7 MB in the beginning and 290.5 MB in the end (delta: 43.2 MB). Peak memory consumption was 141.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 6597.07 ms. Allocated memory was 379.6 MB in the beginning and 480.2 MB in the end (delta: 100.7 MB). Free memory was 290.5 MB in the beginning and 303.3 MB in the end (delta: -12.9 MB). Peak memory consumption was 87.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5108.2ms, 85 PlacesBefore, 28 PlacesAfterwards, 80 TransitionsBefore, 22 TransitionsAfterwards, 992 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, 2978 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1198, positive: 1078, positive conditional: 0, positive unconditional: 1078, negative: 120, negative conditional: 0, negative unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 699, positive: 665, positive conditional: 0, positive unconditional: 665, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 699, positive: 665, positive conditional: 0, positive unconditional: 665, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 699, positive: 658, positive conditional: 0, positive unconditional: 658, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 433, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 409, negative conditional: 0, negative unconditional: 409, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1198, positive: 413, positive conditional: 0, positive unconditional: 413, negative: 86, negative conditional: 0, negative unconditional: 86, unknown: 699, unknown conditional: 0, unknown unconditional: 699] , Statistics on independence cache: Total cache size (in pairs): 1243, Positive cache size: 1209, Positive conditional cache size: 0, Positive unconditional cache size: 1209, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t1705; [L811] FCALL, FORK 0 pthread_create(&t1705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 1 x$w_buff1 = x$w_buff0 [L739] 1 x$w_buff0 = 1 [L740] 1 x$w_buff1_used = x$w_buff0_used [L741] 1 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L743] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L744] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L745] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L746] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L749] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L812] 0 pthread_t t1706; [L813] FCALL, FORK 0 pthread_create(&t1706, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 x$flush_delayed = weak$$choice2 [L775] 2 x$mem_tmp = x [L776] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L776] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L777] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L777] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L778] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L778] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L779] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L779] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L780] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L780] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L781] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L781] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L781] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L782] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L782] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = x [L784] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L784] 2 x = x$flush_delayed ? x$mem_tmp : x [L785] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L756] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L819] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L819] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L819] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L819] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L820] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L821] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L821] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L822] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L823] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L826] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 6410.0ms, OverallIterations: 7, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 436.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5194.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 31 SDtfs, 12 SDslu, 20 SDs, 0 SdLazy, 110 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 156.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 102.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=6, InterpolantAutomatonStates: 28, 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: 17.1ms SsaConstructionTime, 226.4ms SatisfiabilityAnalysisTime, 327.8ms InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 297 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...