/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/mix021_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:23:05,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:23:05,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:23:05,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:23:05,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:23:05,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:23:05,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:23:05,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:23:05,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:23:05,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:23:05,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:23:05,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:23:05,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:23:05,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:23:05,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:23:05,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:23:05,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:23:05,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:23:05,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:23:05,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:23:05,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:23:05,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:23:05,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:23:05,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:23:05,991 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:23:05,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:23:05,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:23:05,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:23:05,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:23:05,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:23:05,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:23:05,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:23:05,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:23:05,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:23:05,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:23:05,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:23:05,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:23:05,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:23:05,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:23:05,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:23:05,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:23:06,000 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:06,025 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:23:06,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:23:06,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:23:06,028 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:23:06,028 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:23:06,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:23:06,028 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:23:06,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:23:06,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:23:06,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:23:06,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:23:06,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:23:06,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:23:06,029 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:23:06,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:23:06,029 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:23:06,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:23:06,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:23:06,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:23:06,030 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:23:06,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:23:06,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:23:06,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:23:06,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:23:06,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:23:06,030 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:23:06,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:23:06,030 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:23:06,031 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:23:06,031 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:06,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:23:06,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:23:06,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:23:06,314 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:23:06,314 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:23:06,315 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_power.opt.i [2021-03-25 14:23:06,374 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a1f0b82/0e75e20db14e4463b88068bfe5d951a5/FLAG23c4479dd [2021-03-25 14:23:06,808 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:23:06,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_power.opt.i [2021-03-25 14:23:06,822 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a1f0b82/0e75e20db14e4463b88068bfe5d951a5/FLAG23c4479dd [2021-03-25 14:23:06,842 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6a1f0b82/0e75e20db14e4463b88068bfe5d951a5 [2021-03-25 14:23:06,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:23:06,846 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:23:06,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:23:06,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:23:06,854 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:23:06,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:23:06" (1/1) ... [2021-03-25 14:23:06,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c35b5b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:23:06, skipping insertion in model container [2021-03-25 14:23:06,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:23:06" (1/1) ... [2021-03-25 14:23:06,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:23:06,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:23:07,049 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/mix021_power.opt.i[950,963] [2021-03-25 14:23:07,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:23:07,246 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:23:07,253 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/mix021_power.opt.i[950,963] [2021-03-25 14:23:07,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:23:07,324 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:23:07,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:23:07 WrapperNode [2021-03-25 14:23:07,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:23:07,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:23:07,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:23:07,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:23:07,330 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:07" (1/1) ... [2021-03-25 14:23:07,340 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:07" (1/1) ... [2021-03-25 14:23:07,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:23:07,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:23:07,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:23:07,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:23:07,398 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:07" (1/1) ... [2021-03-25 14:23:07,398 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:07" (1/1) ... [2021-03-25 14:23:07,401 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:07" (1/1) ... [2021-03-25 14:23:07,401 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:07" (1/1) ... [2021-03-25 14:23:07,417 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:07" (1/1) ... [2021-03-25 14:23:07,419 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:07" (1/1) ... [2021-03-25 14:23:07,421 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:07" (1/1) ... [2021-03-25 14:23:07,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:23:07,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:23:07,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:23:07,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:23:07,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:23:07" (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:07,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:23:07,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:23:07,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:23:07,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:23:07,519 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:23:07,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:23:07,520 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:23:07,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:23:07,520 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:23:07,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:23:07,521 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:23:07,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:23:07,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:23:07,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:23:07,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:23:07,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:23:07,523 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:09,295 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:23:09,295 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:23:09,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:23:09 BoogieIcfgContainer [2021-03-25 14:23:09,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:23:09,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:23:09,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:23:09,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:23:09,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:23:06" (1/3) ... [2021-03-25 14:23:09,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a964a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:23:09, skipping insertion in model container [2021-03-25 14:23:09,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:23:07" (2/3) ... [2021-03-25 14:23:09,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a964a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:23:09, skipping insertion in model container [2021-03-25 14:23:09,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:23:09" (3/3) ... [2021-03-25 14:23:09,301 INFO L111 eAbstractionObserver]: Analyzing ICFG mix021_power.opt.i [2021-03-25 14:23:09,305 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:23:09,308 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:23:09,308 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:23:09,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,336 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,336 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,337 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,337 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,338 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,338 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,338 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,338 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,339 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,339 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,339 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,339 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,349 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,349 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,349 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,349 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,349 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,349 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,349 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,350 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,361 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,361 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,365 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,366 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,368 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,369 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,369 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,370 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,371 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,372 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,372 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:23:09,373 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:23:09,384 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 14:23:09,397 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:23:09,397 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:23:09,397 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:23:09,397 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:23:09,397 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:23:09,397 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:23:09,397 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:23:09,397 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:23:09,404 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 248 flow [2021-03-25 14:23:09,430 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2021-03-25 14:23:09,430 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:23:09,433 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-25 14:23:09,434 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 114 transitions, 248 flow [2021-03-25 14:23:09,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 110 transitions, 232 flow [2021-03-25 14:23:09,438 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:23:09,446 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 110 transitions, 232 flow [2021-03-25 14:23:09,448 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 110 transitions, 232 flow [2021-03-25 14:23:09,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 232 flow [2021-03-25 14:23:09,464 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2021-03-25 14:23:09,464 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:23:09,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-25 14:23:09,467 INFO L142 LiptonReduction]: Number of co-enabled transitions 2394 [2021-03-25 14:23:10,688 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:23:11,056 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:23:11,176 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:23:12,434 INFO L154 LiptonReduction]: Checked pairs total: 4138 [2021-03-25 14:23:12,435 INFO L156 LiptonReduction]: Total number of compositions: 77 [2021-03-25 14:23:12,436 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2999 [2021-03-25 14:23:12,451 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-03-25 14:23:12,451 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:23:12,452 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:23:12,452 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:23:12,452 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:23:12,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:23:12,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1487368769, now seen corresponding path program 1 times [2021-03-25 14:23:12,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:23:12,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036075189] [2021-03-25 14:23:12,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:23:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:23:12,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:12,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:23:12,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:12,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:23:12,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036075189] [2021-03-25 14:23:12,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:23:12,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:23:12,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384857736] [2021-03-25 14:23:12,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:23:12,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:23:12,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:23:12,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:23:12,723 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 191 [2021-03-25 14:23:12,725 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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:23:12,725 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:23:12,725 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 191 [2021-03-25 14:23:12,726 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:23:12,764 INFO L129 PetriNetUnfolder]: 13/102 cut-off events. [2021-03-25 14:23:12,765 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:23:12,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 102 events. 13/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 357 event pairs, 5 based on Foata normal form. 7/99 useless extension candidates. Maximal degree in co-relation 125. Up to 25 conditions per place. [2021-03-25 14:23:12,766 INFO L132 encePairwiseOnDemand]: 187/191 looper letters, 6 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2021-03-25 14:23:12,766 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 42 transitions, 112 flow [2021-03-25 14:23:12,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:23:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:23:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2021-03-25 14:23:12,776 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9092495636998255 [2021-03-25 14:23:12,776 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 521 transitions. [2021-03-25 14:23:12,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions. [2021-03-25 14:23:12,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:23:12,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions. [2021-03-25 14:23:12,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:23:12,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 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:23:12,787 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 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:23:12,789 INFO L185 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 3 states and 521 transitions. [2021-03-25 14:23:12,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 42 transitions, 112 flow [2021-03-25 14:23:12,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 42 transitions, 108 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:23:12,792 INFO L241 Difference]: Finished difference. Result has 51 places, 40 transitions, 92 flow [2021-03-25 14:23:12,793 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2021-03-25 14:23:12,794 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -4 predicate places. [2021-03-25 14:23:12,794 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:23:12,794 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 40 transitions, 92 flow [2021-03-25 14:23:12,794 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 40 transitions, 92 flow [2021-03-25 14:23:12,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 92 flow [2021-03-25 14:23:12,799 INFO L129 PetriNetUnfolder]: 0/40 cut-off events. [2021-03-25 14:23:12,799 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:23:12,799 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:23:12,799 INFO L142 LiptonReduction]: Number of co-enabled transitions 468 [2021-03-25 14:23:14,516 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 14:23:14,705 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 14:23:15,055 WARN L205 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 14:23:15,197 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 14:23:15,203 INFO L154 LiptonReduction]: Checked pairs total: 2294 [2021-03-25 14:23:15,203 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-25 14:23:15,203 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2409 [2021-03-25 14:23:15,204 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2021-03-25 14:23:15,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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:23:15,208 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:23:15,208 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:23:15,208 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:23:15,208 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:23:15,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:23:15,210 INFO L82 PathProgramCache]: Analyzing trace with hash -972262985, now seen corresponding path program 1 times [2021-03-25 14:23:15,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:23:15,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249786020] [2021-03-25 14:23:15,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:23:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:23:15,368 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:23:15,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:23:15,378 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:23:15,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:23:15,383 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:23:15,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249786020] [2021-03-25 14:23:15,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:23:15,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:23:15,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850741756] [2021-03-25 14:23:15,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:23:15,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:23:15,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:23:15,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:23:15,393 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 204 [2021-03-25 14:23:15,394 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 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:23:15,394 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:23:15,394 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 204 [2021-03-25 14:23:15,394 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:23:15,599 INFO L129 PetriNetUnfolder]: 517/994 cut-off events. [2021-03-25 14:23:15,599 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:23:15,602 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1800 conditions, 994 events. 517/994 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 5929 event pairs, 102 based on Foata normal form. 0/908 useless extension candidates. Maximal degree in co-relation 1791. Up to 325 conditions per place. [2021-03-25 14:23:15,605 INFO L132 encePairwiseOnDemand]: 194/204 looper letters, 8 selfloop transitions, 8 changer transitions 16/49 dead transitions. [2021-03-25 14:23:15,605 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 174 flow [2021-03-25 14:23:15,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:23:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:23:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 838 transitions. [2021-03-25 14:23:15,614 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8215686274509804 [2021-03-25 14:23:15,614 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 838 transitions. [2021-03-25 14:23:15,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 838 transitions. [2021-03-25 14:23:15,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:23:15,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 838 transitions. [2021-03-25 14:23:15,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.6) internal successors, (838), 5 states have internal predecessors, (838), 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:23:15,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 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:23:15,621 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 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:23:15,621 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 5 states and 838 transitions. [2021-03-25 14:23:15,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 174 flow [2021-03-25 14:23:15,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:23:15,622 INFO L241 Difference]: Finished difference. Result has 44 places, 33 transitions, 136 flow [2021-03-25 14:23:15,622 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2021-03-25 14:23:15,623 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -11 predicate places. [2021-03-25 14:23:15,623 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:23:15,623 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 136 flow [2021-03-25 14:23:15,623 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 136 flow [2021-03-25 14:23:15,623 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 33 transitions, 136 flow [2021-03-25 14:23:15,728 INFO L129 PetriNetUnfolder]: 276/595 cut-off events. [2021-03-25 14:23:15,728 INFO L130 PetriNetUnfolder]: For 201/224 co-relation queries the response was YES. [2021-03-25 14:23:15,730 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1454 conditions, 595 events. 276/595 cut-off events. For 201/224 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3645 event pairs, 104 based on Foata normal form. 0/575 useless extension candidates. Maximal degree in co-relation 1443. Up to 325 conditions per place. [2021-03-25 14:23:15,734 INFO L142 LiptonReduction]: Number of co-enabled transitions 420 [2021-03-25 14:23:15,840 INFO L154 LiptonReduction]: Checked pairs total: 200 [2021-03-25 14:23:15,840 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:23:15,840 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 217 [2021-03-25 14:23:15,841 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 136 flow [2021-03-25 14:23:15,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 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:23:15,842 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:23:15,842 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:23:15,842 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:23:15,843 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:23:15,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:23:15,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2058432458, now seen corresponding path program 1 times [2021-03-25 14:23:15,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:23:15,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979841465] [2021-03-25 14:23:15,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:23:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:23:15,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:15,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:15,895 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:23:15,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979841465] [2021-03-25 14:23:15,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:23:15,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:23:15,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130719018] [2021-03-25 14:23:15,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:23:15,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:23:15,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:23:15,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:23:15,897 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 204 [2021-03-25 14:23:15,897 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 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:23:15,897 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:23:15,897 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 204 [2021-03-25 14:23:15,898 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:23:15,952 INFO L129 PetriNetUnfolder]: 231/512 cut-off events. [2021-03-25 14:23:15,953 INFO L130 PetriNetUnfolder]: For 342/497 co-relation queries the response was YES. [2021-03-25 14:23:15,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 512 events. 231/512 cut-off events. For 342/497 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2914 event pairs, 75 based on Foata normal form. 9/498 useless extension candidates. Maximal degree in co-relation 1360. Up to 278 conditions per place. [2021-03-25 14:23:15,956 INFO L132 encePairwiseOnDemand]: 200/204 looper letters, 5 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2021-03-25 14:23:15,956 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 180 flow [2021-03-25 14:23:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:23:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:23:15,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2021-03-25 14:23:15,958 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8839869281045751 [2021-03-25 14:23:15,958 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2021-03-25 14:23:15,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2021-03-25 14:23:15,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:23:15,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2021-03-25 14:23:15,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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:23:15,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 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:23:15,961 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 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:23:15,961 INFO L185 Difference]: Start difference. First operand has 41 places, 33 transitions, 136 flow. Second operand 3 states and 541 transitions. [2021-03-25 14:23:15,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 180 flow [2021-03-25 14:23:15,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 142 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-03-25 14:23:15,966 INFO L241 Difference]: Finished difference. Result has 40 places, 37 transitions, 147 flow [2021-03-25 14:23:15,966 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2021-03-25 14:23:15,966 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -15 predicate places. [2021-03-25 14:23:15,966 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:23:15,967 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 37 transitions, 147 flow [2021-03-25 14:23:15,967 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 37 transitions, 147 flow [2021-03-25 14:23:15,967 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 37 transitions, 147 flow [2021-03-25 14:23:16,011 INFO L129 PetriNetUnfolder]: 231/540 cut-off events. [2021-03-25 14:23:16,012 INFO L130 PetriNetUnfolder]: For 93/145 co-relation queries the response was YES. [2021-03-25 14:23:16,013 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 540 events. 231/540 cut-off events. For 93/145 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3342 event pairs, 77 based on Foata normal form. 1/525 useless extension candidates. Maximal degree in co-relation 1071. Up to 278 conditions per place. [2021-03-25 14:23:16,017 INFO L142 LiptonReduction]: Number of co-enabled transitions 492 [2021-03-25 14:23:16,060 INFO L154 LiptonReduction]: Checked pairs total: 188 [2021-03-25 14:23:16,060 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:23:16,060 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 94 [2021-03-25 14:23:16,064 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 147 flow [2021-03-25 14:23:16,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 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:23:16,064 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:23:16,064 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:23:16,065 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:23:16,065 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:23:16,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:23:16,065 INFO L82 PathProgramCache]: Analyzing trace with hash -424041506, now seen corresponding path program 1 times [2021-03-25 14:23:16,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:23:16,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794331342] [2021-03-25 14:23:16,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:23:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:23:16,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:16,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:16,153 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:23:16,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794331342] [2021-03-25 14:23:16,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:23:16,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:23:16,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697418781] [2021-03-25 14:23:16,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:23:16,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:23:16,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:23:16,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:23:16,155 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 204 [2021-03-25 14:23:16,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 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:23:16,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:23:16,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 204 [2021-03-25 14:23:16,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:23:16,205 INFO L129 PetriNetUnfolder]: 189/436 cut-off events. [2021-03-25 14:23:16,205 INFO L130 PetriNetUnfolder]: For 263/366 co-relation queries the response was YES. [2021-03-25 14:23:16,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 436 events. 189/436 cut-off events. For 263/366 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2367 event pairs, 59 based on Foata normal form. 6/427 useless extension candidates. Maximal degree in co-relation 942. Up to 230 conditions per place. [2021-03-25 14:23:16,209 INFO L132 encePairwiseOnDemand]: 201/204 looper letters, 1 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2021-03-25 14:23:16,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 155 flow [2021-03-25 14:23:16,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:23:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:23:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 544 transitions. [2021-03-25 14:23:16,212 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2021-03-25 14:23:16,212 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 544 transitions. [2021-03-25 14:23:16,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 544 transitions. [2021-03-25 14:23:16,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:23:16,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 544 transitions. [2021-03-25 14:23:16,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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:23:16,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 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:23:16,215 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 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:23:16,215 INFO L185 Difference]: Start difference. First operand has 40 places, 37 transitions, 147 flow. Second operand 3 states and 544 transitions. [2021-03-25 14:23:16,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 155 flow [2021-03-25 14:23:16,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:23:16,218 INFO L241 Difference]: Finished difference. Result has 42 places, 37 transitions, 153 flow [2021-03-25 14:23:16,218 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2021-03-25 14:23:16,218 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -13 predicate places. [2021-03-25 14:23:16,218 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:23:16,218 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 37 transitions, 153 flow [2021-03-25 14:23:16,218 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 37 transitions, 153 flow [2021-03-25 14:23:16,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 153 flow [2021-03-25 14:23:16,250 INFO L129 PetriNetUnfolder]: 189/432 cut-off events. [2021-03-25 14:23:16,250 INFO L130 PetriNetUnfolder]: For 139/143 co-relation queries the response was YES. [2021-03-25 14:23:16,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 432 events. 189/432 cut-off events. For 139/143 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2439 event pairs, 55 based on Foata normal form. 1/422 useless extension candidates. Maximal degree in co-relation 939. Up to 230 conditions per place. [2021-03-25 14:23:16,253 INFO L142 LiptonReduction]: Number of co-enabled transitions 490 [2021-03-25 14:23:16,261 INFO L154 LiptonReduction]: Checked pairs total: 166 [2021-03-25 14:23:16,261 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:23:16,261 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 43 [2021-03-25 14:23:16,262 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 153 flow [2021-03-25 14:23:16,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 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:23:16,262 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:23:16,262 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:23:16,263 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:23:16,263 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:23:16,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:23:16,263 INFO L82 PathProgramCache]: Analyzing trace with hash 517996780, now seen corresponding path program 1 times [2021-03-25 14:23:16,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:23:16,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382399159] [2021-03-25 14:23:16,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:23:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:23:16,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:16,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:16,334 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:23:16,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382399159] [2021-03-25 14:23:16,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:23:16,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:23:16,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812352776] [2021-03-25 14:23:16,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:23:16,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:23:16,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:23:16,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:23:16,336 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 204 [2021-03-25 14:23:16,337 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 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:23:16,337 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:23:16,337 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 204 [2021-03-25 14:23:16,337 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:23:16,379 INFO L129 PetriNetUnfolder]: 173/408 cut-off events. [2021-03-25 14:23:16,380 INFO L130 PetriNetUnfolder]: For 292/400 co-relation queries the response was YES. [2021-03-25 14:23:16,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 408 events. 173/408 cut-off events. For 292/400 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2207 event pairs, 42 based on Foata normal form. 7/400 useless extension candidates. Maximal degree in co-relation 986. Up to 210 conditions per place. [2021-03-25 14:23:16,382 INFO L132 encePairwiseOnDemand]: 200/204 looper letters, 5 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2021-03-25 14:23:16,382 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 189 flow [2021-03-25 14:23:16,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:23:16,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:23:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2021-03-25 14:23:16,384 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8839869281045751 [2021-03-25 14:23:16,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2021-03-25 14:23:16,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2021-03-25 14:23:16,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:23:16,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2021-03-25 14:23:16,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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:23:16,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 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:23:16,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 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:23:16,387 INFO L185 Difference]: Start difference. First operand has 42 places, 37 transitions, 153 flow. Second operand 3 states and 541 transitions. [2021-03-25 14:23:16,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 189 flow [2021-03-25 14:23:16,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 183 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:23:16,389 INFO L241 Difference]: Finished difference. Result has 43 places, 41 transitions, 188 flow [2021-03-25 14:23:16,389 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2021-03-25 14:23:16,389 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -12 predicate places. [2021-03-25 14:23:16,390 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:23:16,390 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 41 transitions, 188 flow [2021-03-25 14:23:16,390 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 41 transitions, 188 flow [2021-03-25 14:23:16,390 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 41 transitions, 188 flow [2021-03-25 14:23:16,420 INFO L129 PetriNetUnfolder]: 173/403 cut-off events. [2021-03-25 14:23:16,420 INFO L130 PetriNetUnfolder]: For 212/218 co-relation queries the response was YES. [2021-03-25 14:23:16,421 INFO L84 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 403 events. 173/403 cut-off events. For 212/218 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2258 event pairs, 35 based on Foata normal form. 1/394 useless extension candidates. Maximal degree in co-relation 972. Up to 210 conditions per place. [2021-03-25 14:23:16,423 INFO L142 LiptonReduction]: Number of co-enabled transitions 558 [2021-03-25 14:23:16,430 INFO L154 LiptonReduction]: Checked pairs total: 274 [2021-03-25 14:23:16,430 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:23:16,430 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40 [2021-03-25 14:23:16,434 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 188 flow [2021-03-25 14:23:16,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 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:23:16,434 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:23:16,434 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:23:16,435 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:23:16,435 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:23:16,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:23:16,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1990306982, now seen corresponding path program 1 times [2021-03-25 14:23:16,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:23:16,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265299257] [2021-03-25 14:23:16,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:23:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:23:16,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:16,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:23:16,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:16,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:16,493 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:23:16,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:23:16,504 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:23:16,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265299257] [2021-03-25 14:23:16,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:23:16,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:23:16,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222838631] [2021-03-25 14:23:16,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:23:16,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:23:16,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:23:16,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:23:16,507 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 204 [2021-03-25 14:23:16,507 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 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:23:16,507 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:23:16,507 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 204 [2021-03-25 14:23:16,507 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:23:16,577 INFO L129 PetriNetUnfolder]: 171/454 cut-off events. [2021-03-25 14:23:16,577 INFO L130 PetriNetUnfolder]: For 339/966 co-relation queries the response was YES. [2021-03-25 14:23:16,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 454 events. 171/454 cut-off events. For 339/966 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2702 event pairs, 40 based on Foata normal form. 27/467 useless extension candidates. Maximal degree in co-relation 1348. Up to 222 conditions per place. [2021-03-25 14:23:16,580 INFO L132 encePairwiseOnDemand]: 195/204 looper letters, 15 selfloop transitions, 15 changer transitions 1/48 dead transitions. [2021-03-25 14:23:16,580 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 282 flow [2021-03-25 14:23:16,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:23:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:23:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 682 transitions. [2021-03-25 14:23:16,582 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8357843137254902 [2021-03-25 14:23:16,582 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 682 transitions. [2021-03-25 14:23:16,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 682 transitions. [2021-03-25 14:23:16,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:23:16,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 682 transitions. [2021-03-25 14:23:16,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 170.5) internal successors, (682), 4 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:23:16,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 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:23:16,585 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 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:23:16,585 INFO L185 Difference]: Start difference. First operand has 43 places, 41 transitions, 188 flow. Second operand 4 states and 682 transitions. [2021-03-25 14:23:16,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 282 flow [2021-03-25 14:23:16,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 277 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:23:16,587 INFO L241 Difference]: Finished difference. Result has 48 places, 45 transitions, 272 flow [2021-03-25 14:23:16,587 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=272, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2021-03-25 14:23:16,588 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -7 predicate places. [2021-03-25 14:23:16,588 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:23:16,588 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 45 transitions, 272 flow [2021-03-25 14:23:16,588 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 45 transitions, 272 flow [2021-03-25 14:23:16,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 45 transitions, 272 flow [2021-03-25 14:23:16,623 INFO L129 PetriNetUnfolder]: 171/443 cut-off events. [2021-03-25 14:23:16,623 INFO L130 PetriNetUnfolder]: For 578/626 co-relation queries the response was YES. [2021-03-25 14:23:16,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 443 events. 171/443 cut-off events. For 578/626 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2681 event pairs, 41 based on Foata normal form. 1/435 useless extension candidates. Maximal degree in co-relation 1322. Up to 222 conditions per place. [2021-03-25 14:23:16,627 INFO L142 LiptonReduction]: Number of co-enabled transitions 624 [2021-03-25 14:23:16,640 INFO L154 LiptonReduction]: Checked pairs total: 540 [2021-03-25 14:23:16,640 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:23:16,640 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 52 [2021-03-25 14:23:16,641 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 272 flow [2021-03-25 14:23:16,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 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:23:16,642 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:23:16,642 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:23:16,642 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:23:16,642 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:23:16,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:23:16,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2032225210, now seen corresponding path program 1 times [2021-03-25 14:23:16,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:23:16,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267505560] [2021-03-25 14:23:16,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:23:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:23:16,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:16,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:16,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:16,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:16,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:16,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:23:16,733 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:23:16,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267505560] [2021-03-25 14:23:16,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:23:16,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:23:16,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868083274] [2021-03-25 14:23:16,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:23:16,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:23:16,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:23:16,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:23:16,735 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 204 [2021-03-25 14:23:16,735 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 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:23:16,735 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:23:16,735 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 204 [2021-03-25 14:23:16,735 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:23:17,007 INFO L129 PetriNetUnfolder]: 1527/2853 cut-off events. [2021-03-25 14:23:17,007 INFO L130 PetriNetUnfolder]: For 1415/1625 co-relation queries the response was YES. [2021-03-25 14:23:17,015 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6526 conditions, 2853 events. 1527/2853 cut-off events. For 1415/1625 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 22621 event pairs, 680 based on Foata normal form. 216/2521 useless extension candidates. Maximal degree in co-relation 6507. Up to 2015 conditions per place. [2021-03-25 14:23:17,025 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 12 selfloop transitions, 10 changer transitions 0/59 dead transitions. [2021-03-25 14:23:17,025 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 344 flow [2021-03-25 14:23:17,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:23:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:23:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 859 transitions. [2021-03-25 14:23:17,027 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.842156862745098 [2021-03-25 14:23:17,027 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 859 transitions. [2021-03-25 14:23:17,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 859 transitions. [2021-03-25 14:23:17,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:23:17,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 859 transitions. [2021-03-25 14:23:17,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 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:23:17,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 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:23:17,030 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 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:23:17,030 INFO L185 Difference]: Start difference. First operand has 48 places, 45 transitions, 272 flow. Second operand 5 states and 859 transitions. [2021-03-25 14:23:17,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 344 flow [2021-03-25 14:23:17,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 340 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-03-25 14:23:17,036 INFO L241 Difference]: Finished difference. Result has 55 places, 54 transitions, 343 flow [2021-03-25 14:23:17,037 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=343, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2021-03-25 14:23:17,037 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2021-03-25 14:23:17,037 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:23:17,037 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 54 transitions, 343 flow [2021-03-25 14:23:17,037 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 54 transitions, 343 flow [2021-03-25 14:23:17,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 343 flow [2021-03-25 14:23:17,194 INFO L129 PetriNetUnfolder]: 1078/2086 cut-off events. [2021-03-25 14:23:17,194 INFO L130 PetriNetUnfolder]: For 2516/3176 co-relation queries the response was YES. [2021-03-25 14:23:17,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6491 conditions, 2086 events. 1078/2086 cut-off events. For 2516/3176 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 16565 event pairs, 450 based on Foata normal form. 25/1913 useless extension candidates. Maximal degree in co-relation 6469. Up to 1388 conditions per place. [2021-03-25 14:23:17,230 INFO L142 LiptonReduction]: Number of co-enabled transitions 974 [2021-03-25 14:23:17,311 INFO L154 LiptonReduction]: Checked pairs total: 378 [2021-03-25 14:23:17,311 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:23:17,311 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 274 [2021-03-25 14:23:17,314 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 337 flow [2021-03-25 14:23:17,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 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:23:17,314 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:23:17,314 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:23:17,314 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:23:17,314 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:23:17,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:23:17,315 INFO L82 PathProgramCache]: Analyzing trace with hash -302814013, now seen corresponding path program 1 times [2021-03-25 14:23:17,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:23:17,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285375660] [2021-03-25 14:23:17,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:23:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:23:17,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:17,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:23:17,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:17,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:17,369 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:23:17,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:23:17,377 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:23:17,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285375660] [2021-03-25 14:23:17,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:23:17,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:23:17,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612810168] [2021-03-25 14:23:17,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:23:17,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:23:17,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:23:17,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:23:17,379 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 204 [2021-03-25 14:23:17,379 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 337 flow. Second operand has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 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:23:17,380 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:23:17,380 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 204 [2021-03-25 14:23:17,380 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:23:17,646 INFO L129 PetriNetUnfolder]: 1383/2610 cut-off events. [2021-03-25 14:23:17,647 INFO L130 PetriNetUnfolder]: For 4046/5812 co-relation queries the response was YES. [2021-03-25 14:23:17,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8280 conditions, 2610 events. 1383/2610 cut-off events. For 4046/5812 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 19924 event pairs, 678 based on Foata normal form. 122/2441 useless extension candidates. Maximal degree in co-relation 8256. Up to 1828 conditions per place. [2021-03-25 14:23:17,677 INFO L132 encePairwiseOnDemand]: 195/204 looper letters, 24 selfloop transitions, 17 changer transitions 0/62 dead transitions. [2021-03-25 14:23:17,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 62 transitions, 488 flow [2021-03-25 14:23:17,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:23:17,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:23:17,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 682 transitions. [2021-03-25 14:23:17,679 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8357843137254902 [2021-03-25 14:23:17,679 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 682 transitions. [2021-03-25 14:23:17,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 682 transitions. [2021-03-25 14:23:17,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:23:17,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 682 transitions. [2021-03-25 14:23:17,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 170.5) internal successors, (682), 4 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:23:17,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 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:23:17,682 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 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:23:17,682 INFO L185 Difference]: Start difference. First operand has 55 places, 53 transitions, 337 flow. Second operand 4 states and 682 transitions. [2021-03-25 14:23:17,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 62 transitions, 488 flow [2021-03-25 14:23:17,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 62 transitions, 481 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:23:17,721 INFO L241 Difference]: Finished difference. Result has 57 places, 57 transitions, 458 flow [2021-03-25 14:23:17,721 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=458, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2021-03-25 14:23:17,721 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2021-03-25 14:23:17,721 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:23:17,721 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 57 transitions, 458 flow [2021-03-25 14:23:17,722 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 57 transitions, 458 flow [2021-03-25 14:23:17,722 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 57 transitions, 458 flow [2021-03-25 14:23:17,945 INFO L129 PetriNetUnfolder]: 1338/2503 cut-off events. [2021-03-25 14:23:17,945 INFO L130 PetriNetUnfolder]: For 3602/4464 co-relation queries the response was YES. [2021-03-25 14:23:17,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7656 conditions, 2503 events. 1338/2503 cut-off events. For 3602/4464 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 19437 event pairs, 661 based on Foata normal form. 10/2278 useless extension candidates. Maximal degree in co-relation 7631. Up to 1755 conditions per place. [2021-03-25 14:23:17,971 INFO L142 LiptonReduction]: Number of co-enabled transitions 906 [2021-03-25 14:23:18,138 INFO L154 LiptonReduction]: Checked pairs total: 198 [2021-03-25 14:23:18,138 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:23:18,138 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 417 [2021-03-25 14:23:18,140 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 458 flow [2021-03-25 14:23:18,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 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:23:18,141 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:23:18,141 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:23:18,141 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:23:18,141 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:23:18,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:23:18,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1100615148, now seen corresponding path program 1 times [2021-03-25 14:23:18,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:23:18,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942788179] [2021-03-25 14:23:18,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:23:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:23:18,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:18,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:18,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:18,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:18,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:18,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:18,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:18,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:23:18,231 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:23:18,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942788179] [2021-03-25 14:23:18,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:23:18,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:23:18,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323864868] [2021-03-25 14:23:18,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:23:18,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:23:18,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:23:18,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:23:18,234 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 204 [2021-03-25 14:23:18,235 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 458 flow. Second operand has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 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:23:18,235 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:23:18,235 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 204 [2021-03-25 14:23:18,235 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:23:18,540 INFO L129 PetriNetUnfolder]: 1576/3048 cut-off events. [2021-03-25 14:23:18,540 INFO L130 PetriNetUnfolder]: For 3808/9821 co-relation queries the response was YES. [2021-03-25 14:23:18,552 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11076 conditions, 3048 events. 1576/3048 cut-off events. For 3808/9821 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 24198 event pairs, 211 based on Foata normal form. 519/3216 useless extension candidates. Maximal degree in co-relation 11049. Up to 2198 conditions per place. [2021-03-25 14:23:18,564 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 13 selfloop transitions, 14 changer transitions 0/72 dead transitions. [2021-03-25 14:23:18,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 72 transitions, 592 flow [2021-03-25 14:23:18,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:23:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:23:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1031 transitions. [2021-03-25 14:23:18,567 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8423202614379085 [2021-03-25 14:23:18,567 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1031 transitions. [2021-03-25 14:23:18,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1031 transitions. [2021-03-25 14:23:18,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:23:18,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1031 transitions. [2021-03-25 14:23:18,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 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:23:18,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 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:23:18,572 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 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:23:18,572 INFO L185 Difference]: Start difference. First operand has 57 places, 57 transitions, 458 flow. Second operand 6 states and 1031 transitions. [2021-03-25 14:23:18,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 72 transitions, 592 flow [2021-03-25 14:23:18,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 584 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-03-25 14:23:18,577 INFO L241 Difference]: Finished difference. Result has 65 places, 66 transitions, 570 flow [2021-03-25 14:23:18,577 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=570, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2021-03-25 14:23:18,578 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 10 predicate places. [2021-03-25 14:23:18,578 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:23:18,578 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 66 transitions, 570 flow [2021-03-25 14:23:18,578 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 66 transitions, 570 flow [2021-03-25 14:23:18,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 66 transitions, 570 flow [2021-03-25 14:23:18,725 INFO L129 PetriNetUnfolder]: 999/2102 cut-off events. [2021-03-25 14:23:18,725 INFO L130 PetriNetUnfolder]: For 5656/8444 co-relation queries the response was YES. [2021-03-25 14:23:18,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9511 conditions, 2102 events. 999/2102 cut-off events. For 5656/8444 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 17415 event pairs, 193 based on Foata normal form. 49/2029 useless extension candidates. Maximal degree in co-relation 9481. Up to 1566 conditions per place. [2021-03-25 14:23:18,754 INFO L142 LiptonReduction]: Number of co-enabled transitions 1332 [2021-03-25 14:23:19,298 INFO L154 LiptonReduction]: Checked pairs total: 665 [2021-03-25 14:23:19,298 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:23:19,298 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 720 [2021-03-25 14:23:19,299 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 562 flow [2021-03-25 14:23:19,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 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:23:19,299 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:23:19,299 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:23:19,299 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:23:19,299 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:23:19,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:23:19,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1116918575, now seen corresponding path program 1 times [2021-03-25 14:23:19,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:23:19,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840896862] [2021-03-25 14:23:19,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:23:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:23:19,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:19,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:19,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:19,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:19,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:19,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:19,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:19,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:19,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:19,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:23:19,393 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:23:19,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840896862] [2021-03-25 14:23:19,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:23:19,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:23:19,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210516642] [2021-03-25 14:23:19,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:23:19,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:23:19,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:23:19,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:23:19,395 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 204 [2021-03-25 14:23:19,395 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 562 flow. Second operand has 6 states, 6 states have (on average 167.83333333333334) internal successors, (1007), 6 states have internal predecessors, (1007), 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:23:19,396 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:23:19,396 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 204 [2021-03-25 14:23:19,396 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:23:19,627 INFO L129 PetriNetUnfolder]: 1105/2162 cut-off events. [2021-03-25 14:23:19,627 INFO L130 PetriNetUnfolder]: For 6476/13533 co-relation queries the response was YES. [2021-03-25 14:23:19,638 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10399 conditions, 2162 events. 1105/2162 cut-off events. For 6476/13533 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 15918 event pairs, 49 based on Foata normal form. 550/2446 useless extension candidates. Maximal degree in co-relation 10367. Up to 1496 conditions per place. [2021-03-25 14:23:19,649 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 10 selfloop transitions, 18 changer transitions 4/77 dead transitions. [2021-03-25 14:23:19,649 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 77 transitions, 718 flow [2021-03-25 14:23:19,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:23:19,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:23:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1203 transitions. [2021-03-25 14:23:19,651 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.842436974789916 [2021-03-25 14:23:19,652 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1203 transitions. [2021-03-25 14:23:19,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1203 transitions. [2021-03-25 14:23:19,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:23:19,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1203 transitions. [2021-03-25 14:23:19,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 171.85714285714286) internal successors, (1203), 7 states have internal predecessors, (1203), 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:23:19,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 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:23:19,656 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 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:23:19,656 INFO L185 Difference]: Start difference. First operand has 65 places, 65 transitions, 562 flow. Second operand 7 states and 1203 transitions. [2021-03-25 14:23:19,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 77 transitions, 718 flow [2021-03-25 14:23:19,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 77 transitions, 652 flow, removed 28 selfloop flow, removed 4 redundant places. [2021-03-25 14:23:19,705 INFO L241 Difference]: Finished difference. Result has 68 places, 70 transitions, 618 flow [2021-03-25 14:23:19,705 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=618, PETRI_PLACES=68, PETRI_TRANSITIONS=70} [2021-03-25 14:23:19,706 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 13 predicate places. [2021-03-25 14:23:19,706 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:23:19,706 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 70 transitions, 618 flow [2021-03-25 14:23:19,706 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 70 transitions, 618 flow [2021-03-25 14:23:19,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 70 transitions, 618 flow [2021-03-25 14:23:19,794 INFO L129 PetriNetUnfolder]: 531/1246 cut-off events. [2021-03-25 14:23:19,794 INFO L130 PetriNetUnfolder]: For 3645/4266 co-relation queries the response was YES. [2021-03-25 14:23:19,798 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5622 conditions, 1246 events. 531/1246 cut-off events. For 3645/4266 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 9576 event pairs, 46 based on Foata normal form. 3/1195 useless extension candidates. Maximal degree in co-relation 5591. Up to 790 conditions per place. [2021-03-25 14:23:19,806 INFO L142 LiptonReduction]: Number of co-enabled transitions 1284 [2021-03-25 14:23:19,919 INFO L154 LiptonReduction]: Checked pairs total: 665 [2021-03-25 14:23:19,920 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:23:19,920 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 214 [2021-03-25 14:23:19,921 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 69 transitions, 608 flow [2021-03-25 14:23:19,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 167.83333333333334) internal successors, (1007), 6 states have internal predecessors, (1007), 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:23:19,921 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:23:19,921 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:23:19,921 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:23:19,922 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:23:19,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:23:19,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1894560240, now seen corresponding path program 1 times [2021-03-25 14:23:19,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:23:19,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932757448] [2021-03-25 14:23:19,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:23:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:23:19,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:19,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:19,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:19,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:19,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:19,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:19,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:19,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:19,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:19,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:20,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:20,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:23:20,004 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:23:20,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932757448] [2021-03-25 14:23:20,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:23:20,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:23:20,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365461642] [2021-03-25 14:23:20,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:23:20,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:23:20,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:23:20,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:23:20,006 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 204 [2021-03-25 14:23:20,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 69 transitions, 608 flow. Second operand has 7 states, 7 states have (on average 167.85714285714286) internal successors, (1175), 7 states have internal predecessors, (1175), 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:23:20,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:23:20,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 204 [2021-03-25 14:23:20,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:23:20,184 INFO L129 PetriNetUnfolder]: 942/1757 cut-off events. [2021-03-25 14:23:20,185 INFO L130 PetriNetUnfolder]: For 5444/9104 co-relation queries the response was YES. [2021-03-25 14:23:20,192 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7837 conditions, 1757 events. 942/1757 cut-off events. For 5444/9104 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 11764 event pairs, 32 based on Foata normal form. 309/1810 useless extension candidates. Maximal degree in co-relation 7804. Up to 956 conditions per place. [2021-03-25 14:23:20,198 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 6 selfloop transitions, 18 changer transitions 17/74 dead transitions. [2021-03-25 14:23:20,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 74 transitions, 674 flow [2021-03-25 14:23:20,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:23:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:23:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1367 transitions. [2021-03-25 14:23:20,201 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8376225490196079 [2021-03-25 14:23:20,201 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1367 transitions. [2021-03-25 14:23:20,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1367 transitions. [2021-03-25 14:23:20,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:23:20,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1367 transitions. [2021-03-25 14:23:20,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 170.875) internal successors, (1367), 8 states have internal predecessors, (1367), 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:23:20,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 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:23:20,206 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 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:23:20,206 INFO L185 Difference]: Start difference. First operand has 68 places, 69 transitions, 608 flow. Second operand 8 states and 1367 transitions. [2021-03-25 14:23:20,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 74 transitions, 674 flow [2021-03-25 14:23:20,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 74 transitions, 621 flow, removed 17 selfloop flow, removed 5 redundant places. [2021-03-25 14:23:20,249 INFO L241 Difference]: Finished difference. Result has 71 places, 54 transitions, 445 flow [2021-03-25 14:23:20,249 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=445, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2021-03-25 14:23:20,249 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2021-03-25 14:23:20,249 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:23:20,249 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 54 transitions, 445 flow [2021-03-25 14:23:20,250 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 54 transitions, 445 flow [2021-03-25 14:23:20,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 54 transitions, 445 flow [2021-03-25 14:23:20,280 INFO L129 PetriNetUnfolder]: 186/456 cut-off events. [2021-03-25 14:23:20,280 INFO L130 PetriNetUnfolder]: For 1125/1197 co-relation queries the response was YES. [2021-03-25 14:23:20,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1883 conditions, 456 events. 186/456 cut-off events. For 1125/1197 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2674 event pairs, 24 based on Foata normal form. 1/435 useless extension candidates. Maximal degree in co-relation 1851. Up to 157 conditions per place. [2021-03-25 14:23:20,284 INFO L142 LiptonReduction]: Number of co-enabled transitions 652 [2021-03-25 14:23:20,529 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:23:20,644 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:23:20,968 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 14:23:21,101 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 14:23:21,114 INFO L154 LiptonReduction]: Checked pairs total: 579 [2021-03-25 14:23:21,114 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:23:21,114 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 865 [2021-03-25 14:23:21,114 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 429 flow [2021-03-25 14:23:21,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 167.85714285714286) internal successors, (1175), 7 states have internal predecessors, (1175), 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:23:21,115 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:23:21,115 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:23:21,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:23:21,115 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:23:21,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:23:21,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1801873150, now seen corresponding path program 1 times [2021-03-25 14:23:21,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:23:21,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352122403] [2021-03-25 14:23:21,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:23:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:23:21,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:21,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:23:21,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:21,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:21,194 INFO L142 QuantifierPusher]: treesize reduction 12, result has 55.6 percent of original size [2021-03-25 14:23:21,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 14:23:21,204 INFO L142 QuantifierPusher]: treesize reduction 18, result has 69.0 percent of original size [2021-03-25 14:23:21,205 INFO L147 QuantifierPusher]: treesize reduction 13, result has 67.5 percent of original size 27 [2021-03-25 14:23:21,218 INFO L142 QuantifierPusher]: treesize reduction 10, result has 54.5 percent of original size [2021-03-25 14:23:21,218 INFO L147 QuantifierPusher]: treesize reduction 4, result has 66.7 percent of original size 8 [2021-03-25 14:23:21,225 INFO L142 QuantifierPusher]: treesize reduction 10, result has 76.7 percent of original size [2021-03-25 14:23:21,226 INFO L147 QuantifierPusher]: treesize reduction 4, result has 87.9 percent of original size 29 [2021-03-25 14:23:21,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:21,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:23:21,244 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:23:21,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352122403] [2021-03-25 14:23:21,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:23:21,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:23:21,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140475722] [2021-03-25 14:23:21,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:23:21,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:23:21,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:23:21,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:23:21,247 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 206 [2021-03-25 14:23:21,247 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 429 flow. Second operand has 6 states, 6 states have (on average 148.16666666666666) internal successors, (889), 6 states have internal predecessors, (889), 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:23:21,247 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:23:21,247 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 206 [2021-03-25 14:23:21,247 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:23:21,530 INFO L129 PetriNetUnfolder]: 811/1704 cut-off events. [2021-03-25 14:23:21,530 INFO L130 PetriNetUnfolder]: For 10027/10599 co-relation queries the response was YES. [2021-03-25 14:23:21,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7249 conditions, 1704 events. 811/1704 cut-off events. For 10027/10599 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 12516 event pairs, 55 based on Foata normal form. 120/1745 useless extension candidates. Maximal degree in co-relation 7215. Up to 473 conditions per place. [2021-03-25 14:23:21,538 INFO L132 encePairwiseOnDemand]: 195/206 looper letters, 32 selfloop transitions, 46 changer transitions 26/128 dead transitions. [2021-03-25 14:23:21,539 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 128 transitions, 1305 flow [2021-03-25 14:23:21,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:23:21,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:23:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1380 transitions. [2021-03-25 14:23:21,541 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7443365695792881 [2021-03-25 14:23:21,541 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1380 transitions. [2021-03-25 14:23:21,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1380 transitions. [2021-03-25 14:23:21,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:23:21,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1380 transitions. [2021-03-25 14:23:21,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 153.33333333333334) internal successors, (1380), 9 states have internal predecessors, (1380), 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:23:21,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 206.0) internal successors, (2060), 10 states have internal predecessors, (2060), 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:23:21,546 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 206.0) internal successors, (2060), 10 states have internal predecessors, (2060), 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:23:21,546 INFO L185 Difference]: Start difference. First operand has 67 places, 51 transitions, 429 flow. Second operand 9 states and 1380 transitions. [2021-03-25 14:23:21,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 128 transitions, 1305 flow [2021-03-25 14:23:21,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 128 transitions, 1069 flow, removed 22 selfloop flow, removed 12 redundant places. [2021-03-25 14:23:21,574 INFO L241 Difference]: Finished difference. Result has 68 places, 87 transitions, 781 flow [2021-03-25 14:23:21,574 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=781, PETRI_PLACES=68, PETRI_TRANSITIONS=87} [2021-03-25 14:23:21,574 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 13 predicate places. [2021-03-25 14:23:21,575 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:23:21,575 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 87 transitions, 781 flow [2021-03-25 14:23:21,575 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 87 transitions, 781 flow [2021-03-25 14:23:21,575 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 87 transitions, 781 flow [2021-03-25 14:23:21,628 INFO L129 PetriNetUnfolder]: 391/878 cut-off events. [2021-03-25 14:23:21,628 INFO L130 PetriNetUnfolder]: For 2727/2832 co-relation queries the response was YES. [2021-03-25 14:23:21,631 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3094 conditions, 878 events. 391/878 cut-off events. For 2727/2832 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6128 event pairs, 4 based on Foata normal form. 36/863 useless extension candidates. Maximal degree in co-relation 3065. Up to 251 conditions per place. [2021-03-25 14:23:21,635 INFO L142 LiptonReduction]: Number of co-enabled transitions 1002 [2021-03-25 14:23:21,653 INFO L154 LiptonReduction]: Checked pairs total: 205 [2021-03-25 14:23:21,653 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:23:21,653 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 78 [2021-03-25 14:23:21,655 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 87 transitions, 781 flow [2021-03-25 14:23:21,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 148.16666666666666) internal successors, (889), 6 states have internal predecessors, (889), 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:23:21,655 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:23:21,655 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:23:21,655 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:23:21,655 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:23:21,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:23:21,655 INFO L82 PathProgramCache]: Analyzing trace with hash -2065340506, now seen corresponding path program 1 times [2021-03-25 14:23:21,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:23:21,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407922838] [2021-03-25 14:23:21,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:23:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:23:21,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:21,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:23:21,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:21,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:21,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:23:21,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:23:21,702 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:23:21,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:23:21,711 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:23:21,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407922838] [2021-03-25 14:23:21,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:23:21,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:23:21,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63621324] [2021-03-25 14:23:21,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:23:21,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:23:21,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:23:21,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:23:21,712 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 206 [2021-03-25 14:23:21,713 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 87 transitions, 781 flow. Second operand has 5 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 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:23:21,713 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:23:21,713 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 206 [2021-03-25 14:23:21,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:23:21,814 INFO L129 PetriNetUnfolder]: 440/976 cut-off events. [2021-03-25 14:23:21,814 INFO L130 PetriNetUnfolder]: For 3670/3868 co-relation queries the response was YES. [2021-03-25 14:23:21,817 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3715 conditions, 976 events. 440/976 cut-off events. For 3670/3868 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6568 event pairs, 9 based on Foata normal form. 53/969 useless extension candidates. Maximal degree in co-relation 3684. Up to 282 conditions per place. [2021-03-25 14:23:21,818 INFO L132 encePairwiseOnDemand]: 196/206 looper letters, 5 selfloop transitions, 8 changer transitions 68/107 dead transitions. [2021-03-25 14:23:21,818 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 107 transitions, 1169 flow [2021-03-25 14:23:21,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:23:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:23:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1006 transitions. [2021-03-25 14:23:21,820 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.813915857605178 [2021-03-25 14:23:21,820 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1006 transitions. [2021-03-25 14:23:21,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1006 transitions. [2021-03-25 14:23:21,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:23:21,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1006 transitions. [2021-03-25 14:23:21,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 167.66666666666666) internal successors, (1006), 6 states have internal predecessors, (1006), 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:23:21,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 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:23:21,824 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 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:23:21,824 INFO L185 Difference]: Start difference. First operand has 68 places, 87 transitions, 781 flow. Second operand 6 states and 1006 transitions. [2021-03-25 14:23:21,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 107 transitions, 1169 flow [2021-03-25 14:23:21,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 107 transitions, 1154 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:23:21,837 INFO L241 Difference]: Finished difference. Result has 72 places, 39 transitions, 290 flow [2021-03-25 14:23:21,837 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=290, PETRI_PLACES=72, PETRI_TRANSITIONS=39} [2021-03-25 14:23:21,837 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 17 predicate places. [2021-03-25 14:23:21,837 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:23:21,837 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 39 transitions, 290 flow [2021-03-25 14:23:21,837 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 39 transitions, 290 flow [2021-03-25 14:23:21,837 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 39 transitions, 290 flow [2021-03-25 14:23:21,846 INFO L129 PetriNetUnfolder]: 48/139 cut-off events. [2021-03-25 14:23:21,846 INFO L130 PetriNetUnfolder]: For 749/779 co-relation queries the response was YES. [2021-03-25 14:23:21,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 139 events. 48/139 cut-off events. For 749/779 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 594 event pairs, 5 based on Foata normal form. 9/140 useless extension candidates. Maximal degree in co-relation 514. Up to 42 conditions per place. [2021-03-25 14:23:21,847 INFO L142 LiptonReduction]: Number of co-enabled transitions 202 [2021-03-25 14:23:22,459 WARN L205 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-03-25 14:23:22,715 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-25 14:23:23,921 WARN L205 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 14:23:24,453 WARN L205 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 14:23:24,942 WARN L205 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 164 [2021-03-25 14:23:25,061 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2021-03-25 14:23:26,319 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 333 DAG size of output: 231 [2021-03-25 14:23:26,618 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-25 14:23:26,658 INFO L154 LiptonReduction]: Checked pairs total: 71 [2021-03-25 14:23:26,658 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 14:23:26,658 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4821 [2021-03-25 14:23:26,658 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 37 transitions, 283 flow [2021-03-25 14:23:26,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 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:23:26,659 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:23:26,659 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:23:26,659 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:23:26,659 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:23:26,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:23:26,659 INFO L82 PathProgramCache]: Analyzing trace with hash -115953166, now seen corresponding path program 2 times [2021-03-25 14:23:26,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:23:26,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017583852] [2021-03-25 14:23:26,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:23:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:23:26,693 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:23:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:23:26,737 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:23:26,758 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:23:26,758 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:23:26,758 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 14:23:26,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:23:26 BasicIcfg [2021-03-25 14:23:26,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:23:26,841 INFO L168 Benchmark]: Toolchain (without parser) took 19994.62 ms. Allocated memory was 373.3 MB in the beginning and 929.0 MB in the end (delta: 555.7 MB). Free memory was 336.5 MB in the beginning and 522.0 MB in the end (delta: -185.4 MB). Peak memory consumption was 371.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:23:26,841 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 373.3 MB. Free memory was 354.7 MB in the beginning and 354.6 MB in the end (delta: 74.9 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:23:26,841 INFO L168 Benchmark]: CACSL2BoogieTranslator took 474.24 ms. Allocated memory is still 373.3 MB. Free memory was 336.3 MB in the beginning and 332.7 MB in the end (delta: 3.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 16.0 GB. [2021-03-25 14:23:26,841 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.55 ms. Allocated memory is still 373.3 MB. Free memory was 332.7 MB in the beginning and 329.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:23:26,841 INFO L168 Benchmark]: Boogie Preprocessor took 47.08 ms. Allocated memory is still 373.3 MB. Free memory was 329.1 MB in the beginning and 326.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:23:26,842 INFO L168 Benchmark]: RCFGBuilder took 1872.33 ms. Allocated memory is still 373.3 MB. Free memory was 326.4 MB in the beginning and 205.6 MB in the end (delta: 120.8 MB). Peak memory consumption was 148.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:23:26,842 INFO L168 Benchmark]: TraceAbstraction took 17543.03 ms. Allocated memory was 373.3 MB in the beginning and 929.0 MB in the end (delta: 555.7 MB). Free memory was 205.6 MB in the beginning and 522.0 MB in the end (delta: -316.4 MB). Peak memory consumption was 239.3 MB. Max. memory is 16.0 GB. [2021-03-25 14:23:26,843 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.09 ms. Allocated memory is still 373.3 MB. Free memory was 354.7 MB in the beginning and 354.6 MB in the end (delta: 74.9 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 474.24 ms. Allocated memory is still 373.3 MB. Free memory was 336.3 MB in the beginning and 332.7 MB in the end (delta: 3.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 50.55 ms. Allocated memory is still 373.3 MB. Free memory was 332.7 MB in the beginning and 329.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 47.08 ms. Allocated memory is still 373.3 MB. Free memory was 329.1 MB in the beginning and 326.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1872.33 ms. Allocated memory is still 373.3 MB. Free memory was 326.4 MB in the beginning and 205.6 MB in the end (delta: 120.8 MB). Peak memory consumption was 148.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 17543.03 ms. Allocated memory was 373.3 MB in the beginning and 929.0 MB in the end (delta: 555.7 MB). Free memory was 205.6 MB in the beginning and 522.0 MB in the end (delta: -316.4 MB). Peak memory consumption was 239.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: 2987.0ms, 121 PlacesBefore, 55 PlacesAfterwards, 110 TransitionsBefore, 43 TransitionsAfterwards, 2394 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 4138 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2113, positive: 2015, positive conditional: 0, positive unconditional: 2015, negative: 98, negative conditional: 0, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1466, positive: 1428, positive conditional: 0, positive unconditional: 1428, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1466, positive: 1428, positive conditional: 0, positive unconditional: 1428, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1466, positive: 1413, positive conditional: 0, positive unconditional: 1413, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 343, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 306, negative conditional: 0, negative unconditional: 306, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2113, positive: 587, positive conditional: 0, positive unconditional: 587, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 1466, unknown conditional: 0, unknown unconditional: 1466] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2408.6ms, 51 PlacesBefore, 38 PlacesAfterwards, 40 TransitionsBefore, 27 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 2294 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 871, positive: 744, positive conditional: 0, positive unconditional: 744, negative: 127, negative conditional: 0, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 137, positive: 113, positive conditional: 0, positive unconditional: 113, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 137, positive: 113, positive conditional: 0, positive unconditional: 113, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 137, positive: 105, positive conditional: 0, positive unconditional: 105, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 273, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 248, negative conditional: 0, negative unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 871, positive: 631, positive conditional: 0, positive unconditional: 631, negative: 103, negative conditional: 0, negative unconditional: 103, unknown: 137, unknown conditional: 0, unknown unconditional: 137] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 194, Positive conditional cache size: 0, Positive unconditional cache size: 194, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 217.1ms, 44 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 420 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 200 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 72, positive: 63, positive conditional: 0, positive unconditional: 63, 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: 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: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 198, Positive conditional cache size: 0, Positive unconditional cache size: 198, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 93.0ms, 40 PlacesBefore, 40 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 188 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 48, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 28, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 198, Positive conditional cache size: 0, Positive unconditional cache size: 198, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.7ms, 42 PlacesBefore, 42 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 166 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 41, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 198, Positive conditional cache size: 0, Positive unconditional cache size: 198, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.9ms, 43 PlacesBefore, 43 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 274 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 88, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 198, Positive conditional cache size: 0, Positive unconditional cache size: 198, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 52.2ms, 48 PlacesBefore, 48 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 624 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 540 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 88, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 199, Positive conditional cache size: 0, Positive unconditional cache size: 199, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 273.8ms, 55 PlacesBefore, 55 PlacesAfterwards, 54 TransitionsBefore, 53 TransitionsAfterwards, 974 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 378 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 84, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 213, Positive cache size: 189, Positive conditional cache size: 0, Positive unconditional cache size: 189, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 416.5ms, 57 PlacesBefore, 57 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 906 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 198 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 31, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 213, Positive cache size: 189, Positive conditional cache size: 0, Positive unconditional cache size: 189, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 720.3ms, 65 PlacesBefore, 65 PlacesAfterwards, 66 TransitionsBefore, 65 TransitionsAfterwards, 1332 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 665 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 113, positive: 97, positive conditional: 0, positive unconditional: 97, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 113, positive: 87, positive conditional: 0, positive unconditional: 87, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 213, Positive cache size: 189, Positive conditional cache size: 0, Positive unconditional cache size: 189, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 213.6ms, 68 PlacesBefore, 68 PlacesAfterwards, 70 TransitionsBefore, 69 TransitionsAfterwards, 1284 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 665 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 132, positive: 116, positive conditional: 0, positive unconditional: 116, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 132, positive: 105, positive conditional: 0, positive unconditional: 105, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 213, Positive cache size: 189, Positive conditional cache size: 0, Positive unconditional cache size: 189, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 864.2ms, 71 PlacesBefore, 67 PlacesAfterwards, 54 TransitionsBefore, 51 TransitionsAfterwards, 652 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 579 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 113, positive: 92, positive conditional: 0, positive unconditional: 92, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 113, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 170, Positive conditional cache size: 0, Positive unconditional cache size: 170, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 78.5ms, 68 PlacesBefore, 68 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 1002 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 205 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 50, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 170, Positive conditional cache size: 0, Positive unconditional cache size: 170, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4820.7ms, 72 PlacesBefore, 64 PlacesAfterwards, 39 TransitionsBefore, 37 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 71 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 61, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 3, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 3, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 36, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 135, Positive conditional cache size: 0, Positive unconditional cache size: 135, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L862] 0 pthread_t t557; [L863] FCALL, FORK 0 pthread_create(&t557, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 pthread_t t558; [L865] FCALL, FORK 0 pthread_create(&t558, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 pthread_t t559; [L867] FCALL, FORK 0 pthread_create(&t559, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t560; [L869] FCALL, FORK 0 pthread_create(&t560, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 z$flush_delayed = weak$$choice2 [L824] 4 z$mem_tmp = z [L825] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L825] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L825] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L826] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L826] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L827] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L827] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L828] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L828] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L829] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L830] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L831] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = z [L833] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L833] 4 z = z$flush_delayed ? z$mem_tmp : z [L834] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L780] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L788] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L789] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L790] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L792] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L840] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L840] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L841] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L841] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L842] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L842] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L843] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L844] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L844] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L875] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L875] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L875] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L875] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L876] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L876] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L877] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L877] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L878] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L878] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L879] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L879] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 113 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 11.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 17364.2ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2576.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3042.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 120 SDtfs, 83 SDslu, 91 SDs, 0 SdLazy, 304 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 261.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 226.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=781occurred in iteration=12, InterpolantAutomatonStates: 66, 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: 39.1ms SsaConstructionTime, 410.1ms SatisfiabilityAnalysisTime, 765.5ms InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 1261 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...