/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:23:54,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:23:54,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:23:54,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:23:54,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:23:54,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:23:54,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:23:54,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:23:54,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:23:54,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:23:54,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:23:54,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:23:54,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:23:54,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:23:54,376 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:23:54,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:23:54,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:23:54,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:23:54,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:23:54,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:23:54,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:23:54,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:23:54,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:23:54,392 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:23:54,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:23:54,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:23:54,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:23:54,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:23:54,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:23:54,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:23:54,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:23:54,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:23:54,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:23:54,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:23:54,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:23:54,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:23:54,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:23:54,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:23:54,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:23:54,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:23:54,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:23:54,402 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-RepeatedSemanticLbe.epf [2021-03-25 14:23:54,429 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:23:54,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:23:54,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:23:54,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:23:54,432 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:23:54,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:23:54,432 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:23:54,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:23:54,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:23:54,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:23:54,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:23:54,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:23:54,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:23:54,433 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:23:54,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:23:54,433 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:23:54,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:23:54,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:23:54,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:23:54,434 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:23:54,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:23:54,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:23:54,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:23:54,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:23:54,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:23:54,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:23:54,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:23:54,434 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:23:54,434 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:23:54,435 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:23:54,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:23:54,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:23:54,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:23:54,721 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:23:54,722 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:23:54,723 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.opt.i [2021-03-25 14:23:54,776 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a618a1f/122be712fda6468d9c87e69c6a803879/FLAG516370ebd [2021-03-25 14:23:55,472 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:23:55,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.opt.i [2021-03-25 14:23:55,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a618a1f/122be712fda6468d9c87e69c6a803879/FLAG516370ebd [2021-03-25 14:23:55,512 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a618a1f/122be712fda6468d9c87e69c6a803879 [2021-03-25 14:23:55,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:23:55,515 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:23:55,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:23:55,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:23:55,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:23:55,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:23:55" (1/1) ... [2021-03-25 14:23:55,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3856c182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:23:55, skipping insertion in model container [2021-03-25 14:23:55,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:23:55" (1/1) ... [2021-03-25 14:23:55,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:23:55,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:23:55,698 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/mix022_tso.opt.i[948,961] [2021-03-25 14:23:55,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:23:55,912 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:23:55,920 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/mix022_tso.opt.i[948,961] [2021-03-25 14:23:55,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:23:56,034 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:23:56,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:23:56 WrapperNode [2021-03-25 14:23:56,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:23:56,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:23:56,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:23:56,037 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:23:56,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:23:56" (1/1) ... [2021-03-25 14:23:56,069 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:23:56" (1/1) ... [2021-03-25 14:23:56,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:23:56,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:23:56,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:23:56,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:23:56,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:23:56" (1/1) ... [2021-03-25 14:23:56,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:23:56" (1/1) ... [2021-03-25 14:23:56,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:23:56" (1/1) ... [2021-03-25 14:23:56,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:23:56" (1/1) ... [2021-03-25 14:23:56,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:23:56" (1/1) ... [2021-03-25 14:23:56,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:23:56" (1/1) ... [2021-03-25 14:23:56,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:23:56" (1/1) ... [2021-03-25 14:23:56,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:23:56,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:23:56,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:23:56,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:23:56,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:23:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:23:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:23:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:23:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:23:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:23:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:23:56,249 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:23:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:23:56,249 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:23:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:23:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:23:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:23:56,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:23:56,251 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:23:58,043 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:23:58,044 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:23:58,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:23:58 BoogieIcfgContainer [2021-03-25 14:23:58,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:23:58,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:23:58,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:23:58,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:23:58,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:23:55" (1/3) ... [2021-03-25 14:23:58,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ceec77c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:23:58, skipping insertion in model container [2021-03-25 14:23:58,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:23:56" (2/3) ... [2021-03-25 14:23:58,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ceec77c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:23:58, skipping insertion in model container [2021-03-25 14:23:58,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:23:58" (3/3) ... [2021-03-25 14:23:58,052 INFO L111 eAbstractionObserver]: Analyzing ICFG mix022_tso.opt.i [2021-03-25 14:23:58,058 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:23:58,061 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:23:58,061 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:23:58,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,092 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,092 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,093 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,093 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,096 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,096 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,097 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,097 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,097 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,097 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,098 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,098 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,114 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,114 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,116 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,117 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,118 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:58,119 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:23:58,131 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-25 14:23:58,150 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:23:58,150 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:23:58,150 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:23:58,150 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:23:58,150 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:23:58,150 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:23:58,151 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:23:58,151 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:23:58,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 82 transitions, 174 flow [2021-03-25 14:23:58,187 INFO L129 PetriNetUnfolder]: 2/80 cut-off events. [2021-03-25 14:23:58,187 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:23:58,196 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 4. Compared 51 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-03-25 14:23:58,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 82 transitions, 174 flow [2021-03-25 14:23:58,201 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 80 transitions, 166 flow [2021-03-25 14:23:58,202 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:23:58,210 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 80 transitions, 166 flow [2021-03-25 14:23:58,211 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 80 transitions, 166 flow [2021-03-25 14:23:58,213 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 166 flow [2021-03-25 14:23:58,232 INFO L129 PetriNetUnfolder]: 2/80 cut-off events. [2021-03-25 14:23:58,232 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:23:58,232 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 4. Compared 55 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-03-25 14:23:58,234 INFO L142 LiptonReduction]: Number of co-enabled transitions 982 [2021-03-25 14:23:59,807 WARN L205 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 185 [2021-03-25 14:24:00,063 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-25 14:24:01,296 WARN L205 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-25 14:24:01,821 WARN L205 SmtUtils]: Spent 523.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 14:24:01,974 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:24:02,299 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:24:02,403 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:24:03,406 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-25 14:24:03,678 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-25 14:24:04,866 WARN L205 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 265 DAG size of output: 264 [2021-03-25 14:24:05,449 WARN L205 SmtUtils]: Spent 581.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-25 14:24:05,740 INFO L154 LiptonReduction]: Checked pairs total: 1684 [2021-03-25 14:24:05,740 INFO L156 LiptonReduction]: Total number of compositions: 59 [2021-03-25 14:24:05,742 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7541 [2021-03-25 14:24:05,750 INFO L129 PetriNetUnfolder]: 0/12 cut-off events. [2021-03-25 14:24:05,750 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:24:05,750 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:24:05,751 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:24:05,751 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:24:05,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:24:05,755 INFO L82 PathProgramCache]: Analyzing trace with hash -402460950, now seen corresponding path program 1 times [2021-03-25 14:24:05,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:24:05,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844814501] [2021-03-25 14:24:05,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:24:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:24:05,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:24:05,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:24:05,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:24:05,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:24:05,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:24:05,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844814501] [2021-03-25 14:24:05,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:24:05,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:24:05,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994146852] [2021-03-25 14:24:05,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:24:05,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:24:05,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:24:05,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:24:05,970 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 141 [2021-03-25 14:24:05,973 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:05,973 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:24:05,973 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 141 [2021-03-25 14:24:05,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:24:06,040 INFO L129 PetriNetUnfolder]: 33/108 cut-off events. [2021-03-25 14:24:06,040 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:24:06,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 108 events. 33/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 429 event pairs, 15 based on Foata normal form. 8/106 useless extension candidates. Maximal degree in co-relation 168. Up to 55 conditions per place. [2021-03-25 14:24:06,042 INFO L132 encePairwiseOnDemand]: 137/141 looper letters, 8 selfloop transitions, 2 changer transitions 4/29 dead transitions. [2021-03-25 14:24:06,042 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 88 flow [2021-03-25 14:24:06,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:24:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:24:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2021-03-25 14:24:06,055 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8652482269503546 [2021-03-25 14:24:06,056 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2021-03-25 14:24:06,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2021-03-25 14:24:06,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:24:06,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2021-03-25 14:24:06,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:06,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:06,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:06,075 INFO L185 Difference]: Start difference. First operand has 34 places, 28 transitions, 62 flow. Second operand 3 states and 366 transitions. [2021-03-25 14:24:06,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 88 flow [2021-03-25 14:24:06,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:24:06,078 INFO L241 Difference]: Finished difference. Result has 32 places, 22 transitions, 52 flow [2021-03-25 14:24:06,079 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2021-03-25 14:24:06,079 INFO L343 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2021-03-25 14:24:06,079 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:24:06,080 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 22 transitions, 52 flow [2021-03-25 14:24:06,080 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 22 transitions, 52 flow [2021-03-25 14:24:06,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 52 flow [2021-03-25 14:24:06,085 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 14:24:06,086 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:24:06,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:24:06,086 INFO L142 LiptonReduction]: Number of co-enabled transitions 146 [2021-03-25 14:24:06,592 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 14:24:06,861 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 14:24:07,397 WARN L205 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-25 14:24:07,968 WARN L205 SmtUtils]: Spent 569.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-25 14:24:08,371 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:24:08,977 INFO L154 LiptonReduction]: Checked pairs total: 475 [2021-03-25 14:24:08,977 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 14:24:08,977 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2898 [2021-03-25 14:24:08,978 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 42 flow [2021-03-25 14:24:08,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:08,978 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:24:08,979 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:24:08,979 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:24:08,979 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:24:08,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:24:08,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1088924991, now seen corresponding path program 1 times [2021-03-25 14:24:08,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:24:08,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641603157] [2021-03-25 14:24:08,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:24:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:24:09,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:24:09,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:24:09,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:24:09,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:24:09,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:24:09,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:24:09,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:24:09,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:24:09,104 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:24:09,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:24:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:24:09,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641603157] [2021-03-25 14:24:09,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:24:09,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:24:09,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506281185] [2021-03-25 14:24:09,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:24:09,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:24:09,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:24:09,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:24:09,112 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 146 [2021-03-25 14:24:09,112 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 42 flow. Second operand has 6 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:09,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:24:09,113 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 146 [2021-03-25 14:24:09,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:24:09,169 INFO L129 PetriNetUnfolder]: 38/93 cut-off events. [2021-03-25 14:24:09,169 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-25 14:24:09,170 INFO L84 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 93 events. 38/93 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 325 event pairs, 18 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 172. Up to 72 conditions per place. [2021-03-25 14:24:09,171 INFO L132 encePairwiseOnDemand]: 142/146 looper letters, 8 selfloop transitions, 3 changer transitions 0/20 dead transitions. [2021-03-25 14:24:09,171 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 20 transitions, 72 flow [2021-03-25 14:24:09,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:24:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:24:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2021-03-25 14:24:09,175 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7534246575342466 [2021-03-25 14:24:09,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2021-03-25 14:24:09,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2021-03-25 14:24:09,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:24:09,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2021-03-25 14:24:09,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:09,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:09,179 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:09,179 INFO L185 Difference]: Start difference. First operand has 24 places, 17 transitions, 42 flow. Second operand 3 states and 330 transitions. [2021-03-25 14:24:09,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 20 transitions, 72 flow [2021-03-25 14:24:09,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 20 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:24:09,180 INFO L241 Difference]: Finished difference. Result has 25 places, 19 transitions, 57 flow [2021-03-25 14:24:09,180 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2021-03-25 14:24:09,180 INFO L343 CegarLoopForPetriNet]: 34 programPoint places, -9 predicate places. [2021-03-25 14:24:09,180 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:24:09,180 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 19 transitions, 57 flow [2021-03-25 14:24:09,181 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 19 transitions, 57 flow [2021-03-25 14:24:09,181 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 25 places, 19 transitions, 57 flow [2021-03-25 14:24:09,184 INFO L129 PetriNetUnfolder]: 3/27 cut-off events. [2021-03-25 14:24:09,184 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:24:09,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 27 events. 3/27 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 37. Up to 10 conditions per place. [2021-03-25 14:24:09,185 INFO L142 LiptonReduction]: Number of co-enabled transitions 112 [2021-03-25 14:24:09,512 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-03-25 14:24:09,627 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:24:09,834 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-03-25 14:24:09,912 INFO L154 LiptonReduction]: Checked pairs total: 238 [2021-03-25 14:24:09,912 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:24:09,912 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 732 [2021-03-25 14:24:09,914 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 55 flow [2021-03-25 14:24:09,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:09,914 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:24:09,916 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:24:09,916 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:24:09,916 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:24:09,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:24:09,916 INFO L82 PathProgramCache]: Analyzing trace with hash 562151489, now seen corresponding path program 1 times [2021-03-25 14:24:09,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:24:09,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956976834] [2021-03-25 14:24:09,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:24:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:24:10,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:24:10,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:24:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:24:10,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956976834] [2021-03-25 14:24:10,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:24:10,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:24:10,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450102750] [2021-03-25 14:24:10,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:24:10,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:24:10,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:24:10,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:24:10,029 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 147 [2021-03-25 14:24:10,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:10,029 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:24:10,029 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 147 [2021-03-25 14:24:10,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:24:10,042 INFO L129 PetriNetUnfolder]: 2/24 cut-off events. [2021-03-25 14:24:10,043 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-25 14:24:10,043 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 24 events. 2/24 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 2/26 useless extension candidates. Maximal degree in co-relation 37. Up to 8 conditions per place. [2021-03-25 14:24:10,043 INFO L132 encePairwiseOnDemand]: 144/147 looper letters, 1 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2021-03-25 14:24:10,043 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 18 transitions, 61 flow [2021-03-25 14:24:10,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:24:10,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:24:10,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2021-03-25 14:24:10,045 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8798185941043084 [2021-03-25 14:24:10,045 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2021-03-25 14:24:10,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2021-03-25 14:24:10,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:24:10,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2021-03-25 14:24:10,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:10,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:10,049 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:10,049 INFO L185 Difference]: Start difference. First operand has 24 places, 18 transitions, 55 flow. Second operand 3 states and 388 transitions. [2021-03-25 14:24:10,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 18 transitions, 61 flow [2021-03-25 14:24:10,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 18 transitions, 58 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:24:10,049 INFO L241 Difference]: Finished difference. Result has 26 places, 18 transitions, 60 flow [2021-03-25 14:24:10,050 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=52, 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=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2021-03-25 14:24:10,050 INFO L343 CegarLoopForPetriNet]: 34 programPoint places, -8 predicate places. [2021-03-25 14:24:10,050 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:24:10,050 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 18 transitions, 60 flow [2021-03-25 14:24:10,050 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 18 transitions, 60 flow [2021-03-25 14:24:10,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 18 transitions, 60 flow [2021-03-25 14:24:10,055 INFO L129 PetriNetUnfolder]: 2/24 cut-off events. [2021-03-25 14:24:10,055 INFO L130 PetriNetUnfolder]: For 2/3 co-relation queries the response was YES. [2021-03-25 14:24:10,055 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 24 events. 2/24 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 1 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 35. Up to 8 conditions per place. [2021-03-25 14:24:10,056 INFO L142 LiptonReduction]: Number of co-enabled transitions 110 [2021-03-25 14:24:10,085 INFO L154 LiptonReduction]: Checked pairs total: 110 [2021-03-25 14:24:10,085 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:24:10,085 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-03-25 14:24:10,085 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 60 flow [2021-03-25 14:24:10,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:10,086 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:24:10,086 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:24:10,086 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:24:10,086 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:24:10,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:24:10,086 INFO L82 PathProgramCache]: Analyzing trace with hash -2123622403, now seen corresponding path program 1 times [2021-03-25 14:24:10,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:24:10,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817056942] [2021-03-25 14:24:10,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:24:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:24:10,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:24:10,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:24:10,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:24:10,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:24:10,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:24:10,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:24:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:24:10,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817056942] [2021-03-25 14:24:10,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:24:10,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:24:10,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424910809] [2021-03-25 14:24:10,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:24:10,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:24:10,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:24:10,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:24:10,210 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 147 [2021-03-25 14:24:10,210 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:10,210 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:24:10,210 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 147 [2021-03-25 14:24:10,210 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:24:10,232 INFO L129 PetriNetUnfolder]: 8/44 cut-off events. [2021-03-25 14:24:10,232 INFO L130 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2021-03-25 14:24:10,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 44 events. 8/44 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 2 based on Foata normal form. 5/48 useless extension candidates. Maximal degree in co-relation 84. Up to 18 conditions per place. [2021-03-25 14:24:10,232 INFO L132 encePairwiseOnDemand]: 142/147 looper letters, 4 selfloop transitions, 5 changer transitions 3/25 dead transitions. [2021-03-25 14:24:10,233 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 98 flow [2021-03-25 14:24:10,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:24:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:24:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2021-03-25 14:24:10,234 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8353741496598639 [2021-03-25 14:24:10,234 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2021-03-25 14:24:10,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2021-03-25 14:24:10,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:24:10,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2021-03-25 14:24:10,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:10,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:10,237 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:10,238 INFO L185 Difference]: Start difference. First operand has 26 places, 18 transitions, 60 flow. Second operand 5 states and 614 transitions. [2021-03-25 14:24:10,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 98 flow [2021-03-25 14:24:10,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:24:10,239 INFO L241 Difference]: Finished difference. Result has 31 places, 22 transitions, 93 flow [2021-03-25 14:24:10,239 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2021-03-25 14:24:10,239 INFO L343 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2021-03-25 14:24:10,239 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:24:10,239 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 22 transitions, 93 flow [2021-03-25 14:24:10,240 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 93 flow [2021-03-25 14:24:10,241 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 93 flow [2021-03-25 14:24:10,247 INFO L129 PetriNetUnfolder]: 5/38 cut-off events. [2021-03-25 14:24:10,247 INFO L130 PetriNetUnfolder]: For 15/16 co-relation queries the response was YES. [2021-03-25 14:24:10,249 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 38 events. 5/38 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 96 event pairs, 3 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 84. Up to 13 conditions per place. [2021-03-25 14:24:10,251 INFO L142 LiptonReduction]: Number of co-enabled transitions 120 [2021-03-25 14:24:10,297 INFO L154 LiptonReduction]: Checked pairs total: 78 [2021-03-25 14:24:10,297 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:24:10,297 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 58 [2021-03-25 14:24:10,301 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 93 flow [2021-03-25 14:24:10,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:10,301 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:24:10,301 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:24:10,301 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:24:10,301 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:24:10,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:24:10,302 INFO L82 PathProgramCache]: Analyzing trace with hash -157534861, now seen corresponding path program 1 times [2021-03-25 14:24:10,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:24:10,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881325570] [2021-03-25 14:24:10,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:24:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:24:10,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:24:10,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:24:10,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:24:10,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:24:10,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:24:10,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:24:10,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:24:10,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:24:10,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:24:10,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881325570] [2021-03-25 14:24:10,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:24:10,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:24:10,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784142547] [2021-03-25 14:24:10,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:24:10,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:24:10,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:24:10,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:24:10,464 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 147 [2021-03-25 14:24:10,465 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:10,465 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:24:10,465 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 147 [2021-03-25 14:24:10,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:24:10,507 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-25 14:24:10,507 INFO L130 PetriNetUnfolder]: For 31/44 co-relation queries the response was YES. [2021-03-25 14:24:10,508 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 33 events. 3/33 cut-off events. For 31/44 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 64 event pairs, 0 based on Foata normal form. 17/50 useless extension candidates. Maximal degree in co-relation 83. Up to 12 conditions per place. [2021-03-25 14:24:10,508 INFO L132 encePairwiseOnDemand]: 142/147 looper letters, 2 selfloop transitions, 8 changer transitions 2/25 dead transitions. [2021-03-25 14:24:10,508 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 131 flow [2021-03-25 14:24:10,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:24:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:24:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2021-03-25 14:24:10,510 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8299319727891157 [2021-03-25 14:24:10,510 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2021-03-25 14:24:10,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2021-03-25 14:24:10,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:24:10,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2021-03-25 14:24:10,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:10,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 147.0) internal successors, (1176), 8 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:10,514 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 147.0) internal successors, (1176), 8 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:10,514 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 93 flow. Second operand 7 states and 854 transitions. [2021-03-25 14:24:10,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 131 flow [2021-03-25 14:24:10,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 25 transitions, 125 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 14:24:10,515 INFO L241 Difference]: Finished difference. Result has 39 places, 23 transitions, 120 flow [2021-03-25 14:24:10,516 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=120, PETRI_PLACES=39, PETRI_TRANSITIONS=23} [2021-03-25 14:24:10,516 INFO L343 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2021-03-25 14:24:10,516 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:24:10,516 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 23 transitions, 120 flow [2021-03-25 14:24:10,516 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 23 transitions, 120 flow [2021-03-25 14:24:10,516 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 23 transitions, 120 flow [2021-03-25 14:24:10,519 INFO L129 PetriNetUnfolder]: 2/27 cut-off events. [2021-03-25 14:24:10,520 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-03-25 14:24:10,520 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 27 events. 2/27 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 69. Up to 10 conditions per place. [2021-03-25 14:24:10,520 INFO L142 LiptonReduction]: Number of co-enabled transitions 90 [2021-03-25 14:24:11,102 WARN L205 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 182 [2021-03-25 14:24:11,305 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2021-03-25 14:24:13,008 WARN L205 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 337 DAG size of output: 262 [2021-03-25 14:24:13,424 WARN L205 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2021-03-25 14:24:13,637 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-25 14:24:13,854 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-25 14:24:14,416 WARN L205 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 251 [2021-03-25 14:24:14,888 WARN L205 SmtUtils]: Spent 471.00 ms on a formula simplification that was a NOOP. DAG size: 251 [2021-03-25 14:24:14,891 INFO L154 LiptonReduction]: Checked pairs total: 256 [2021-03-25 14:24:14,892 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 14:24:14,892 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4376 [2021-03-25 14:24:14,893 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 19 transitions, 100 flow [2021-03-25 14:24:14,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:14,894 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:24:14,894 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:24:14,894 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:24:14,894 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:24:14,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:24:14,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1887466096, now seen corresponding path program 1 times [2021-03-25 14:24:14,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:24:14,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832448775] [2021-03-25 14:24:14,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:24:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:24:14,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:24:14,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:24:14,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:24:14,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:24:14,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:24:14,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:24:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:24:14,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832448775] [2021-03-25 14:24:14,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:24:14,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:24:14,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824251435] [2021-03-25 14:24:14,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:24:14,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:24:14,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:24:14,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:24:14,976 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 149 [2021-03-25 14:24:14,976 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 19 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:14,976 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:24:14,976 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 149 [2021-03-25 14:24:14,976 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:24:14,993 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-25 14:24:14,993 INFO L130 PetriNetUnfolder]: For 79/80 co-relation queries the response was YES. [2021-03-25 14:24:14,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 31 events. 3/31 cut-off events. For 79/80 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 2/33 useless extension candidates. Maximal degree in co-relation 77. Up to 9 conditions per place. [2021-03-25 14:24:14,994 INFO L132 encePairwiseOnDemand]: 146/149 looper letters, 3 selfloop transitions, 1 changer transitions 3/19 dead transitions. [2021-03-25 14:24:14,994 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 19 transitions, 103 flow [2021-03-25 14:24:14,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:24:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:24:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2021-03-25 14:24:14,995 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8087248322147651 [2021-03-25 14:24:14,995 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2021-03-25 14:24:14,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2021-03-25 14:24:14,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:24:14,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2021-03-25 14:24:14,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:14,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:14,997 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:14,997 INFO L185 Difference]: Start difference. First operand has 36 places, 19 transitions, 100 flow. Second operand 4 states and 482 transitions. [2021-03-25 14:24:14,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 19 transitions, 103 flow [2021-03-25 14:24:14,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 19 transitions, 80 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-03-25 14:24:14,998 INFO L241 Difference]: Finished difference. Result has 30 places, 16 transitions, 67 flow [2021-03-25 14:24:14,999 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=67, PETRI_PLACES=30, PETRI_TRANSITIONS=16} [2021-03-25 14:24:14,999 INFO L343 CegarLoopForPetriNet]: 34 programPoint places, -4 predicate places. [2021-03-25 14:24:14,999 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:24:14,999 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 16 transitions, 67 flow [2021-03-25 14:24:14,999 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 16 transitions, 67 flow [2021-03-25 14:24:14,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 16 transitions, 67 flow [2021-03-25 14:24:15,002 INFO L129 PetriNetUnfolder]: 1/20 cut-off events. [2021-03-25 14:24:15,002 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-03-25 14:24:15,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 20 events. 1/20 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 39. Up to 5 conditions per place. [2021-03-25 14:24:15,002 INFO L142 LiptonReduction]: Number of co-enabled transitions 28 [2021-03-25 14:24:15,097 INFO L154 LiptonReduction]: Checked pairs total: 58 [2021-03-25 14:24:15,097 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:24:15,097 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 98 [2021-03-25 14:24:15,098 INFO L480 AbstractCegarLoop]: Abstraction has has 28 places, 15 transitions, 65 flow [2021-03-25 14:24:15,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:24:15,098 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:24:15,098 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:24:15,098 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:24:15,098 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:24:15,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:24:15,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1357332852, now seen corresponding path program 1 times [2021-03-25 14:24:15,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:24:15,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818838611] [2021-03-25 14:24:15,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:24:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:24:15,132 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:24:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:24:15,185 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:24:15,229 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:24:15,229 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:24:15,229 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:24:15,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:24:15 BasicIcfg [2021-03-25 14:24:15,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:24:15,291 INFO L168 Benchmark]: Toolchain (without parser) took 19775.97 ms. Allocated memory was 346.0 MB in the beginning and 834.7 MB in the end (delta: 488.6 MB). Free memory was 309.5 MB in the beginning and 599.6 MB in the end (delta: -290.1 MB). Peak memory consumption was 201.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:24:15,291 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 346.0 MB. Free memory is still 327.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:24:15,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 518.56 ms. Allocated memory is still 346.0 MB. Free memory was 309.4 MB in the beginning and 304.9 MB in the end (delta: 4.5 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.0 GB. [2021-03-25 14:24:15,292 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.24 ms. Allocated memory is still 346.0 MB. Free memory was 304.9 MB in the beginning and 301.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:24:15,292 INFO L168 Benchmark]: Boogie Preprocessor took 45.62 ms. Allocated memory is still 346.0 MB. Free memory was 301.7 MB in the beginning and 299.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:24:15,293 INFO L168 Benchmark]: RCFGBuilder took 1895.50 ms. Allocated memory is still 346.0 MB. Free memory was 299.6 MB in the beginning and 179.3 MB in the end (delta: 120.3 MB). Peak memory consumption was 150.7 MB. Max. memory is 16.0 GB. [2021-03-25 14:24:15,293 INFO L168 Benchmark]: TraceAbstraction took 17242.57 ms. Allocated memory was 346.0 MB in the beginning and 834.7 MB in the end (delta: 488.6 MB). Free memory was 179.3 MB in the beginning and 599.6 MB in the end (delta: -420.3 MB). Peak memory consumption was 68.3 MB. Max. memory is 16.0 GB. [2021-03-25 14:24:15,294 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 346.0 MB. Free memory is still 327.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 518.56 ms. Allocated memory is still 346.0 MB. Free memory was 309.4 MB in the beginning and 304.9 MB in the end (delta: 4.5 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 68.24 ms. Allocated memory is still 346.0 MB. Free memory was 304.9 MB in the beginning and 301.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 45.62 ms. Allocated memory is still 346.0 MB. Free memory was 301.7 MB in the beginning and 299.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1895.50 ms. Allocated memory is still 346.0 MB. Free memory was 299.6 MB in the beginning and 179.3 MB in the end (delta: 120.3 MB). Peak memory consumption was 150.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 17242.57 ms. Allocated memory was 346.0 MB in the beginning and 834.7 MB in the end (delta: 488.6 MB). Free memory was 179.3 MB in the beginning and 599.6 MB in the end (delta: -420.3 MB). Peak memory consumption was 68.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7528.8ms, 85 PlacesBefore, 34 PlacesAfterwards, 80 TransitionsBefore, 28 TransitionsAfterwards, 982 CoEnabledTransitionPairs, 5 FixpointIterations, 29 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 59 TotalNumberOfCompositions, 1684 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 766, positive: 702, positive conditional: 0, positive unconditional: 702, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 559, positive: 530, positive conditional: 0, positive unconditional: 530, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 559, positive: 530, positive conditional: 0, positive unconditional: 530, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 559, positive: 528, positive conditional: 0, positive unconditional: 528, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 468, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 463, negative conditional: 0, negative unconditional: 463, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 766, positive: 172, positive conditional: 0, positive unconditional: 172, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 559, unknown conditional: 0, unknown unconditional: 559] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2896.9ms, 32 PlacesBefore, 24 PlacesAfterwards, 22 TransitionsBefore, 17 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 475 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 148, positive: 97, positive conditional: 0, positive unconditional: 97, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 46, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 46, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 408, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 401, negative conditional: 0, negative unconditional: 401, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 148, positive: 71, positive conditional: 0, positive unconditional: 71, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 46, unknown conditional: 0, unknown unconditional: 46] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 731.5ms, 25 PlacesBefore, 24 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 238 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 57, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 66, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 54, Positive conditional cache size: 0, Positive unconditional cache size: 54, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.4ms, 26 PlacesBefore, 26 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 110 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 35, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 54, Positive conditional cache size: 0, Positive unconditional cache size: 54, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 57.8ms, 31 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 78 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4375.5ms, 39 PlacesBefore, 36 PlacesAfterwards, 23 TransitionsBefore, 19 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 256 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 123, positive: 87, positive conditional: 0, positive unconditional: 87, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 123, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 98.0ms, 30 PlacesBefore, 28 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 28 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 58 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 73, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 26, Positive conditional cache size: 0, Positive unconditional cache size: 26, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - 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 t599; [L811] FCALL, FORK 0 pthread_create(&t599, ((void *)0), P0, ((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=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] [L812] 0 pthread_t t600; [L813] FCALL, FORK 0 pthread_create(&t600, ((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=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] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 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=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 x$flush_delayed = weak$$choice2 [L772] 2 x$mem_tmp = x [L773] 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) [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 [L773] 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) [L773] 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) [L774] 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)) [L774] 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)) [L775] 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)) [L775] 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)) [L776] 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)) [L776] 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)) [L777] 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)) [L777] 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)) [L778] 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)) [L778] 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)) [L779] 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)) [L779] 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)) [L780] 2 __unbuffered_p1_EAX = x [L781] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L781] 2 x = x$flush_delayed ? x$mem_tmp : x [L782] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 1 y = 1 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=52, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 x = 1 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=52, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 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) [L744] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L744] 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) [L744] 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) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 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 [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L748] 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 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [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 [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 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 0 x$flush_delayed = weak$$choice2 [L829] 0 x$mem_tmp = x [L830] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L830] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L831] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L831] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L832] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L832] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L833] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L833] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L834] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L835] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L836] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L838] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L838] 0 x = x$flush_delayed ? x$mem_tmp : x [L839] 0 x$flush_delayed = (_Bool)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=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 17083.2ms, OverallIterations: 7, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 310.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7596.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 21 SDtfs, 7 SDslu, 11 SDs, 0 SdLazy, 68 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 77.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 70.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=5, InterpolantAutomatonStates: 25, 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: 28.7ms SsaConstructionTime, 367.5ms SatisfiabilityAnalysisTime, 321.8ms InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 223 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...