/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-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix007_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:30:10,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:30:10,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:30:10,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:30:10,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:30:10,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:30:10,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:30:10,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:30:10,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:30:10,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:30:10,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:30:10,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:30:10,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:30:10,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:30:10,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:30:10,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:30:10,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:30:10,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:30:10,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:30:10,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:30:10,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:30:10,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:30:10,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:30:10,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:30:10,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:30:10,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:30:10,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:30:10,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:30:10,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:30:10,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:30:10,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:30:10,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:30:10,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:30:10,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:30:10,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:30:10,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:30:10,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:30:10,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:30:10,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:30:10,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:30:10,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:30:10,861 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-RepeatedVariableLbe.epf [2021-03-25 04:30:10,895 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:30:10,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:30:10,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:30:10,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:30:10,899 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:30:10,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:30:10,899 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:30:10,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:30:10,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:30:10,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:30:10,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:30:10,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:30:10,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:30:10,901 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:30:10,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:30:10,901 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:30:10,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:30:10,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:30:10,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:30:10,902 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:30:10,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:30:10,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:30:10,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:30:10,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:30:10,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:30:10,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:30:10,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:30:10,904 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:30:10,904 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:30:10,904 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:30:10,904 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 04:30:11,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:30:11,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:30:11,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:30:11,224 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:30:11,225 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:30:11,225 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007_tso.oepc.i [2021-03-25 04:30:11,292 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09f37e867/b50a90eaa541406b95a6668689d3e55f/FLAGcbc1daab7 [2021-03-25 04:30:11,758 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:30:11,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007_tso.oepc.i [2021-03-25 04:30:11,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09f37e867/b50a90eaa541406b95a6668689d3e55f/FLAGcbc1daab7 [2021-03-25 04:30:11,788 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09f37e867/b50a90eaa541406b95a6668689d3e55f [2021-03-25 04:30:11,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:30:11,792 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:30:11,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:30:11,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:30:11,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:30:11,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:30:11" (1/1) ... [2021-03-25 04:30:11,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f0fef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:11, skipping insertion in model container [2021-03-25 04:30:11,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:30:11" (1/1) ... [2021-03-25 04:30:11,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:30:11,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:30:12,064 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/mix007_tso.oepc.i[949,962] [2021-03-25 04:30:12,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:30:12,291 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:30:12,302 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/mix007_tso.oepc.i[949,962] [2021-03-25 04:30:12,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:30:12,460 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:30:12,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:12 WrapperNode [2021-03-25 04:30:12,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:30:12,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:30:12,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:30:12,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:30:12,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:12" (1/1) ... [2021-03-25 04:30:12,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:12" (1/1) ... [2021-03-25 04:30:12,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:30:12,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:30:12,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:30:12,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:30:12,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:12" (1/1) ... [2021-03-25 04:30:12,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:12" (1/1) ... [2021-03-25 04:30:12,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:12" (1/1) ... [2021-03-25 04:30:12,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:12" (1/1) ... [2021-03-25 04:30:12,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:12" (1/1) ... [2021-03-25 04:30:12,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:12" (1/1) ... [2021-03-25 04:30:12,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:12" (1/1) ... [2021-03-25 04:30:12,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:30:12,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:30:12,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:30:12,595 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:30:12,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:12" (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 04:30:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:30:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:30:12,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:30:12,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:30:12,676 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:30:12,677 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:30:12,677 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:30:12,677 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:30:12,677 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:30:12,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:30:12,678 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 04:30:12,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 04:30:12,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:30:12,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:30:12,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:30:12,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:30:12,680 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 04:30:14,661 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:30:14,661 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:30:14,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:30:14 BoogieIcfgContainer [2021-03-25 04:30:14,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:30:14,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:30:14,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:30:14,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:30:14,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:30:11" (1/3) ... [2021-03-25 04:30:14,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3eeadb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:30:14, skipping insertion in model container [2021-03-25 04:30:14,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:30:12" (2/3) ... [2021-03-25 04:30:14,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3eeadb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:30:14, skipping insertion in model container [2021-03-25 04:30:14,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:30:14" (3/3) ... [2021-03-25 04:30:14,671 INFO L111 eAbstractionObserver]: Analyzing ICFG mix007_tso.oepc.i [2021-03-25 04:30:14,679 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:30:14,683 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:30:14,684 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:30:14,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,727 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,727 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,727 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,727 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,727 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,728 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,728 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,728 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,733 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,733 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,733 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,733 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,737 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,737 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,738 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,738 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,742 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,742 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,742 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,742 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,742 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,743 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,744 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,753 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,753 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,753 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,753 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,753 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,754 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,754 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,754 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,754 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,755 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,770 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,770 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,770 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,770 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,770 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,770 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,770 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,770 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,771 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,771 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,771 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,771 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,771 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,771 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,771 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,771 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,772 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,772 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,773 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,774 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,774 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,774 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,774 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,774 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,774 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,774 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,774 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,774 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,775 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,775 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,775 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,775 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,775 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,775 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,775 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,775 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,775 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,776 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,776 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,776 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,776 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,776 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,776 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,776 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,776 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,776 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,776 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,776 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,777 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,777 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,777 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,792 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,792 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,792 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,795 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,796 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,801 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,801 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:30:14,802 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:30:14,817 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 04:30:14,834 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:30:14,834 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:30:14,834 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:30:14,834 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:30:14,834 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:30:14,834 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:30:14,834 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:30:14,834 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:30:14,844 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2021-03-25 04:30:14,903 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-25 04:30:14,904 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:30:14,907 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 93 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 04:30:14,908 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 120 transitions, 260 flow [2021-03-25 04:30:14,912 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 116 transitions, 244 flow [2021-03-25 04:30:14,913 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:14,920 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-25 04:30:14,923 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-25 04:30:14,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 244 flow [2021-03-25 04:30:14,946 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-25 04:30:14,946 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:30:14,947 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 96 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 04:30:14,950 INFO L142 LiptonReduction]: Number of co-enabled transitions 2886 [2021-03-25 04:30:16,125 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:30:16,538 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-25 04:30:16,673 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 04:30:17,714 INFO L154 LiptonReduction]: Checked pairs total: 5647 [2021-03-25 04:30:17,714 INFO L156 LiptonReduction]: Total number of compositions: 75 [2021-03-25 04:30:17,717 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2805 [2021-03-25 04:30:17,727 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-03-25 04:30:17,727 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:30:17,727 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:17,728 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:17,728 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:17,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:17,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1588435965, now seen corresponding path program 1 times [2021-03-25 04:30:17,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:17,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831660739] [2021-03-25 04:30:17,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:17,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:17,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:17,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:17,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:17,978 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 04:30:17,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831660739] [2021-03-25 04:30:17,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:17,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:30:17,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156664289] [2021-03-25 04:30:17,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:30:17,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:17,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:30:17,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:30:17,996 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 195 [2021-03-25 04:30:17,999 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:17,999 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:17,999 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 195 [2021-03-25 04:30:18,000 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:18,162 INFO L129 PetriNetUnfolder]: 133/349 cut-off events. [2021-03-25 04:30:18,162 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:30:18,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 349 events. 133/349 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1875 event pairs, 110 based on Foata normal form. 33/362 useless extension candidates. Maximal degree in co-relation 546. Up to 153 conditions per place. [2021-03-25 04:30:18,169 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 11 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2021-03-25 04:30:18,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 52 transitions, 142 flow [2021-03-25 04:30:18,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:30:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:30:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2021-03-25 04:30:18,188 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145299145299145 [2021-03-25 04:30:18,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2021-03-25 04:30:18,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2021-03-25 04:30:18,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:18,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2021-03-25 04:30:18,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 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 04:30:18,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:18,204 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:18,206 INFO L185 Difference]: Start difference. First operand has 62 places, 50 transitions, 112 flow. Second operand 3 states and 535 transitions. [2021-03-25 04:30:18,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 52 transitions, 142 flow [2021-03-25 04:30:18,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 04:30:18,214 INFO L241 Difference]: Finished difference. Result has 58 places, 47 transitions, 106 flow [2021-03-25 04:30:18,216 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2021-03-25 04:30:18,217 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2021-03-25 04:30:18,217 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:18,217 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 47 transitions, 106 flow [2021-03-25 04:30:18,218 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 47 transitions, 106 flow [2021-03-25 04:30:18,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 47 transitions, 106 flow [2021-03-25 04:30:18,226 INFO L129 PetriNetUnfolder]: 0/47 cut-off events. [2021-03-25 04:30:18,226 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:30:18,227 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 47 events. 0/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:30:18,230 INFO L142 LiptonReduction]: Number of co-enabled transitions 702 [2021-03-25 04:30:18,942 INFO L154 LiptonReduction]: Checked pairs total: 3042 [2021-03-25 04:30:18,942 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 04:30:18,942 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 725 [2021-03-25 04:30:18,943 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 82 flow [2021-03-25 04:30:18,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:18,944 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:18,944 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 04:30:18,944 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:30:18,944 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:18,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:18,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1813580090, now seen corresponding path program 1 times [2021-03-25 04:30:18,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:18,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067010521] [2021-03-25 04:30:18,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:19,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:19,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:19,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:19,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:19,052 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:30:19,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:30:19,056 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 04:30:19,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067010521] [2021-03-25 04:30:19,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:19,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:30:19,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241094444] [2021-03-25 04:30:19,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:30:19,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:19,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:30:19,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:30:19,059 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 207 [2021-03-25 04:30:19,059 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:19,059 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:19,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 207 [2021-03-25 04:30:19,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:19,082 INFO L129 PetriNetUnfolder]: 1/37 cut-off events. [2021-03-25 04:30:19,082 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:30:19,082 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 43. Up to 3 conditions per place. [2021-03-25 04:30:19,082 INFO L132 encePairwiseOnDemand]: 203/207 looper letters, 1 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2021-03-25 04:30:19,083 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 37 transitions, 98 flow [2021-03-25 04:30:19,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:30:19,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:30:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 917 transitions. [2021-03-25 04:30:19,085 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8859903381642512 [2021-03-25 04:30:19,085 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 917 transitions. [2021-03-25 04:30:19,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 917 transitions. [2021-03-25 04:30:19,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:19,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 917 transitions. [2021-03-25 04:30:19,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 183.4) internal successors, (917), 5 states have internal predecessors, (917), 0 states have call successors, (0), 0 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 04:30:19,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 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 04:30:19,091 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 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 04:30:19,091 INFO L185 Difference]: Start difference. First operand has 46 places, 35 transitions, 82 flow. Second operand 5 states and 917 transitions. [2021-03-25 04:30:19,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 37 transitions, 98 flow [2021-03-25 04:30:19,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 37 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:30:19,093 INFO L241 Difference]: Finished difference. Result has 49 places, 33 transitions, 82 flow [2021-03-25 04:30:19,093 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2021-03-25 04:30:19,093 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -13 predicate places. [2021-03-25 04:30:19,093 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:19,094 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 33 transitions, 82 flow [2021-03-25 04:30:19,094 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 33 transitions, 82 flow [2021-03-25 04:30:19,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 33 transitions, 82 flow [2021-03-25 04:30:19,098 INFO L129 PetriNetUnfolder]: 0/33 cut-off events. [2021-03-25 04:30:19,098 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:30:19,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:30:19,099 INFO L142 LiptonReduction]: Number of co-enabled transitions 446 [2021-03-25 04:30:19,365 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-25 04:30:19,681 INFO L154 LiptonReduction]: Checked pairs total: 1710 [2021-03-25 04:30:19,682 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:30:19,682 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 589 [2021-03-25 04:30:19,683 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 76 flow [2021-03-25 04:30:19,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:19,683 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:19,683 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 04:30:19,683 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:30:19,684 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:19,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:19,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1935713152, now seen corresponding path program 1 times [2021-03-25 04:30:19,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:19,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227953091] [2021-03-25 04:30:19,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:19,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:19,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:19,770 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 04:30:19,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227953091] [2021-03-25 04:30:19,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:19,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 04:30:19,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978036399] [2021-03-25 04:30:19,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:30:19,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:19,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:30:19,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:30:19,773 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 210 [2021-03-25 04:30:19,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 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 04:30:19,774 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:19,774 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 210 [2021-03-25 04:30:19,774 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:19,783 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-25 04:30:19,783 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 04:30:19,784 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 30 events. 0/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:30:19,784 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 1 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2021-03-25 04:30:19,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 82 flow [2021-03-25 04:30:19,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:30:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:30:19,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2021-03-25 04:30:19,786 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8968253968253969 [2021-03-25 04:30:19,786 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 565 transitions. [2021-03-25 04:30:19,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 565 transitions. [2021-03-25 04:30:19,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:19,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 565 transitions. [2021-03-25 04:30:19,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 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 04:30:19,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 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 04:30:19,791 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 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 04:30:19,791 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 76 flow. Second operand 3 states and 565 transitions. [2021-03-25 04:30:19,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 82 flow [2021-03-25 04:30:19,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 30 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:30:19,793 INFO L241 Difference]: Finished difference. Result has 43 places, 30 transitions, 80 flow [2021-03-25 04:30:19,793 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2021-03-25 04:30:19,793 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -19 predicate places. [2021-03-25 04:30:19,794 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:19,794 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 30 transitions, 80 flow [2021-03-25 04:30:19,794 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 30 transitions, 80 flow [2021-03-25 04:30:19,795 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 30 transitions, 80 flow [2021-03-25 04:30:19,798 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-25 04:30:19,799 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 04:30:19,799 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 30 events. 0/30 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:30:19,799 INFO L142 LiptonReduction]: Number of co-enabled transitions 442 [2021-03-25 04:30:20,107 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 04:30:20,268 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 04:30:20,578 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 04:30:20,745 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 04:30:20,750 INFO L154 LiptonReduction]: Checked pairs total: 1036 [2021-03-25 04:30:20,750 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:30:20,750 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 956 [2021-03-25 04:30:20,751 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 76 flow [2021-03-25 04:30:20,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 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 04:30:20,751 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:20,752 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:20,752 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:30:20,752 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:20,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:20,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1142820115, now seen corresponding path program 1 times [2021-03-25 04:30:20,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:20,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184414806] [2021-03-25 04:30:20,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:20,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:20,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:20,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:20,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:20,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:20,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:20,817 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 04:30:20,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184414806] [2021-03-25 04:30:20,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:20,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:30:20,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921627158] [2021-03-25 04:30:20,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:30:20,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:20,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:30:20,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:30:20,819 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 212 [2021-03-25 04:30:20,820 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:20,820 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:20,820 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 212 [2021-03-25 04:30:20,820 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:20,870 INFO L129 PetriNetUnfolder]: 90/187 cut-off events. [2021-03-25 04:30:20,870 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-03-25 04:30:20,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 187 events. 90/187 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 816 event pairs, 46 based on Foata normal form. 16/201 useless extension candidates. Maximal degree in co-relation 375. Up to 119 conditions per place. [2021-03-25 04:30:20,872 INFO L132 encePairwiseOnDemand]: 205/212 looper letters, 6 selfloop transitions, 5 changer transitions 9/41 dead transitions. [2021-03-25 04:30:20,872 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 142 flow [2021-03-25 04:30:20,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:30:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:30:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 902 transitions. [2021-03-25 04:30:20,874 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8509433962264151 [2021-03-25 04:30:20,875 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 902 transitions. [2021-03-25 04:30:20,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 902 transitions. [2021-03-25 04:30:20,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:20,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 902 transitions. [2021-03-25 04:30:20,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 180.4) internal successors, (902), 5 states have internal predecessors, (902), 0 states have call successors, (0), 0 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 04:30:20,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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 04:30:20,880 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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 04:30:20,880 INFO L185 Difference]: Start difference. First operand has 41 places, 28 transitions, 76 flow. Second operand 5 states and 902 transitions. [2021-03-25 04:30:20,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 142 flow [2021-03-25 04:30:20,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:30:20,882 INFO L241 Difference]: Finished difference. Result has 46 places, 32 transitions, 117 flow [2021-03-25 04:30:20,882 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2021-03-25 04:30:20,882 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -16 predicate places. [2021-03-25 04:30:20,882 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:20,882 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 32 transitions, 117 flow [2021-03-25 04:30:20,882 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 32 transitions, 117 flow [2021-03-25 04:30:20,883 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 32 transitions, 117 flow [2021-03-25 04:30:20,897 INFO L129 PetriNetUnfolder]: 73/154 cut-off events. [2021-03-25 04:30:20,897 INFO L130 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2021-03-25 04:30:20,898 INFO L84 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 154 events. 73/154 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 619 event pairs, 40 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 411. Up to 104 conditions per place. [2021-03-25 04:30:20,899 INFO L142 LiptonReduction]: Number of co-enabled transitions 482 [2021-03-25 04:30:20,903 INFO L154 LiptonReduction]: Checked pairs total: 457 [2021-03-25 04:30:20,904 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:30:20,904 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-25 04:30:20,904 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 117 flow [2021-03-25 04:30:20,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:30:20,905 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:20,905 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 04:30:20,905 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:30:20,905 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:20,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:20,906 INFO L82 PathProgramCache]: Analyzing trace with hash 87571845, now seen corresponding path program 1 times [2021-03-25 04:30:20,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:20,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497339600] [2021-03-25 04:30:20,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:21,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:21,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:21,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:21,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:21,034 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 04:30:21,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:30:21,044 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 04:30:21,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497339600] [2021-03-25 04:30:21,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:21,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:30:21,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842106275] [2021-03-25 04:30:21,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:30:21,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:21,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:30:21,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:30:21,047 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 212 [2021-03-25 04:30:21,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 163.5) internal successors, (654), 4 states have internal predecessors, (654), 0 states have call successors, (0), 0 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 04:30:21,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:21,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 212 [2021-03-25 04:30:21,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:21,257 INFO L129 PetriNetUnfolder]: 661/1335 cut-off events. [2021-03-25 04:30:21,257 INFO L130 PetriNetUnfolder]: For 963/1215 co-relation queries the response was YES. [2021-03-25 04:30:21,264 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3539 conditions, 1335 events. 661/1335 cut-off events. For 963/1215 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 9622 event pairs, 270 based on Foata normal form. 72/1292 useless extension candidates. Maximal degree in co-relation 3525. Up to 783 conditions per place. [2021-03-25 04:30:21,273 INFO L132 encePairwiseOnDemand]: 203/212 looper letters, 12 selfloop transitions, 14 changer transitions 0/49 dead transitions. [2021-03-25 04:30:21,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 207 flow [2021-03-25 04:30:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:30:21,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:30:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 837 transitions. [2021-03-25 04:30:21,275 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.789622641509434 [2021-03-25 04:30:21,276 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 837 transitions. [2021-03-25 04:30:21,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 837 transitions. [2021-03-25 04:30:21,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:21,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 837 transitions. [2021-03-25 04:30:21,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 0 states have call successors, (0), 0 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 04:30:21,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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 04:30:21,281 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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 04:30:21,281 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 117 flow. Second operand 5 states and 837 transitions. [2021-03-25 04:30:21,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 207 flow [2021-03-25 04:30:21,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 200 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:30:21,292 INFO L241 Difference]: Finished difference. Result has 50 places, 44 transitions, 217 flow [2021-03-25 04:30:21,293 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2021-03-25 04:30:21,293 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -12 predicate places. [2021-03-25 04:30:21,293 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:21,293 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 44 transitions, 217 flow [2021-03-25 04:30:21,293 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 44 transitions, 217 flow [2021-03-25 04:30:21,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 217 flow [2021-03-25 04:30:21,430 INFO L129 PetriNetUnfolder]: 667/1359 cut-off events. [2021-03-25 04:30:21,431 INFO L130 PetriNetUnfolder]: For 843/949 co-relation queries the response was YES. [2021-03-25 04:30:21,438 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3630 conditions, 1359 events. 667/1359 cut-off events. For 843/949 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 10111 event pairs, 285 based on Foata normal form. 0/1243 useless extension candidates. Maximal degree in co-relation 3614. Up to 810 conditions per place. [2021-03-25 04:30:21,452 INFO L142 LiptonReduction]: Number of co-enabled transitions 736 [2021-03-25 04:30:21,718 INFO L154 LiptonReduction]: Checked pairs total: 268 [2021-03-25 04:30:21,718 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:30:21,718 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 425 [2021-03-25 04:30:21,719 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 217 flow [2021-03-25 04:30:21,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 163.5) internal successors, (654), 4 states have internal predecessors, (654), 0 states have call successors, (0), 0 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 04:30:21,720 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:21,720 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 04:30:21,720 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:30:21,720 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:21,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:21,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1284750765, now seen corresponding path program 2 times [2021-03-25 04:30:21,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:21,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774023751] [2021-03-25 04:30:21,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:21,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:21,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:21,792 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-25 04:30:21,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:30:21,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:21,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:21,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:21,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:21,801 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 04:30:21,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774023751] [2021-03-25 04:30:21,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:21,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:30:21,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838993815] [2021-03-25 04:30:21,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:30:21,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:21,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:30:21,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:30:21,804 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 212 [2021-03-25 04:30:21,805 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 217 flow. Second operand has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 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 04:30:21,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:21,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 212 [2021-03-25 04:30:21,805 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:21,990 INFO L129 PetriNetUnfolder]: 436/1017 cut-off events. [2021-03-25 04:30:21,990 INFO L130 PetriNetUnfolder]: For 871/1567 co-relation queries the response was YES. [2021-03-25 04:30:21,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3447 conditions, 1017 events. 436/1017 cut-off events. For 871/1567 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 7385 event pairs, 71 based on Foata normal form. 229/1187 useless extension candidates. Maximal degree in co-relation 3429. Up to 647 conditions per place. [2021-03-25 04:30:22,001 INFO L132 encePairwiseOnDemand]: 205/212 looper letters, 10 selfloop transitions, 14 changer transitions 0/57 dead transitions. [2021-03-25 04:30:22,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 341 flow [2021-03-25 04:30:22,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:30:22,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:30:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1082 transitions. [2021-03-25 04:30:22,004 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.85062893081761 [2021-03-25 04:30:22,004 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1082 transitions. [2021-03-25 04:30:22,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1082 transitions. [2021-03-25 04:30:22,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:22,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1082 transitions. [2021-03-25 04:30:22,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 180.33333333333334) internal successors, (1082), 6 states have internal predecessors, (1082), 0 states have call successors, (0), 0 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 04:30:22,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 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 04:30:22,009 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 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 04:30:22,009 INFO L185 Difference]: Start difference. First operand has 50 places, 44 transitions, 217 flow. Second operand 6 states and 1082 transitions. [2021-03-25 04:30:22,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 341 flow [2021-03-25 04:30:22,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 57 transitions, 341 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:30:22,014 INFO L241 Difference]: Finished difference. Result has 58 places, 53 transitions, 337 flow [2021-03-25 04:30:22,014 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=337, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2021-03-25 04:30:22,014 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2021-03-25 04:30:22,014 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:22,014 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 53 transitions, 337 flow [2021-03-25 04:30:22,015 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 53 transitions, 337 flow [2021-03-25 04:30:22,015 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 53 transitions, 337 flow [2021-03-25 04:30:22,113 INFO L129 PetriNetUnfolder]: 452/1059 cut-off events. [2021-03-25 04:30:22,114 INFO L130 PetriNetUnfolder]: For 2153/3004 co-relation queries the response was YES. [2021-03-25 04:30:22,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4209 conditions, 1059 events. 452/1059 cut-off events. For 2153/3004 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 7888 event pairs, 76 based on Foata normal form. 25/1017 useless extension candidates. Maximal degree in co-relation 4188. Up to 676 conditions per place. [2021-03-25 04:30:22,132 INFO L142 LiptonReduction]: Number of co-enabled transitions 1058 [2021-03-25 04:30:22,443 INFO L154 LiptonReduction]: Checked pairs total: 1197 [2021-03-25 04:30:22,443 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:30:22,443 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 429 [2021-03-25 04:30:22,444 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 329 flow [2021-03-25 04:30:22,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 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 04:30:22,444 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:22,444 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 04:30:22,444 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:30:22,444 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:22,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:22,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1330524260, now seen corresponding path program 1 times [2021-03-25 04:30:22,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:22,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954852670] [2021-03-25 04:30:22,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:22,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:22,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:22,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:22,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:22,489 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 04:30:22,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:30:22,499 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 04:30:22,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954852670] [2021-03-25 04:30:22,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:22,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:30:22,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857968602] [2021-03-25 04:30:22,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:30:22,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:22,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:30:22,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:30:22,501 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 212 [2021-03-25 04:30:22,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 329 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 04:30:22,502 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:22,502 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 212 [2021-03-25 04:30:22,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:22,649 INFO L129 PetriNetUnfolder]: 509/1163 cut-off events. [2021-03-25 04:30:22,649 INFO L130 PetriNetUnfolder]: For 2464/3210 co-relation queries the response was YES. [2021-03-25 04:30:22,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4794 conditions, 1163 events. 509/1163 cut-off events. For 2464/3210 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 8334 event pairs, 107 based on Foata normal form. 65/1172 useless extension candidates. Maximal degree in co-relation 4771. Up to 692 conditions per place. [2021-03-25 04:30:22,662 INFO L132 encePairwiseOnDemand]: 206/212 looper letters, 23 selfloop transitions, 11 changer transitions 0/61 dead transitions. [2021-03-25 04:30:22,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 436 flow [2021-03-25 04:30:22,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:30:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:30:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 684 transitions. [2021-03-25 04:30:22,664 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8066037735849056 [2021-03-25 04:30:22,664 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 684 transitions. [2021-03-25 04:30:22,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 684 transitions. [2021-03-25 04:30:22,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:22,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 684 transitions. [2021-03-25 04:30:22,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 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 04:30:22,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 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 04:30:22,668 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 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 04:30:22,668 INFO L185 Difference]: Start difference. First operand has 58 places, 52 transitions, 329 flow. Second operand 4 states and 684 transitions. [2021-03-25 04:30:22,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 436 flow [2021-03-25 04:30:22,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 398 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-25 04:30:22,691 INFO L241 Difference]: Finished difference. Result has 57 places, 53 transitions, 324 flow [2021-03-25 04:30:22,692 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=324, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2021-03-25 04:30:22,692 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2021-03-25 04:30:22,692 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:22,692 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 53 transitions, 324 flow [2021-03-25 04:30:22,692 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 53 transitions, 324 flow [2021-03-25 04:30:22,692 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions, 324 flow [2021-03-25 04:30:22,790 INFO L129 PetriNetUnfolder]: 501/1152 cut-off events. [2021-03-25 04:30:22,791 INFO L130 PetriNetUnfolder]: For 1373/1547 co-relation queries the response was YES. [2021-03-25 04:30:22,796 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3534 conditions, 1152 events. 501/1152 cut-off events. For 1373/1547 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 8393 event pairs, 110 based on Foata normal form. 40/1132 useless extension candidates. Maximal degree in co-relation 3513. Up to 633 conditions per place. [2021-03-25 04:30:22,808 INFO L142 LiptonReduction]: Number of co-enabled transitions 910 [2021-03-25 04:30:22,952 INFO L154 LiptonReduction]: Checked pairs total: 551 [2021-03-25 04:30:22,952 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:30:22,952 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 260 [2021-03-25 04:30:22,955 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 324 flow [2021-03-25 04:30:22,956 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 04:30:22,956 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:22,956 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] [2021-03-25 04:30:22,956 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:30:22,956 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:22,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:22,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1054918569, now seen corresponding path program 1 times [2021-03-25 04:30:22,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:22,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507398016] [2021-03-25 04:30:22,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:23,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:23,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:23,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:23,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:23,114 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-25 04:30:23,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:30:23,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:23,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:23,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:23,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:23,124 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 04:30:23,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507398016] [2021-03-25 04:30:23,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:23,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:30:23,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375562445] [2021-03-25 04:30:23,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:30:23,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:23,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:30:23,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:30:23,127 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 212 [2021-03-25 04:30:23,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 0 states have call successors, (0), 0 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 04:30:23,128 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:23,128 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 212 [2021-03-25 04:30:23,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:23,300 INFO L129 PetriNetUnfolder]: 347/861 cut-off events. [2021-03-25 04:30:23,301 INFO L130 PetriNetUnfolder]: For 1265/1999 co-relation queries the response was YES. [2021-03-25 04:30:23,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3238 conditions, 861 events. 347/861 cut-off events. For 1265/1999 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5911 event pairs, 19 based on Foata normal form. 344/1162 useless extension candidates. Maximal degree in co-relation 3215. Up to 501 conditions per place. [2021-03-25 04:30:23,310 INFO L132 encePairwiseOnDemand]: 205/212 looper letters, 6 selfloop transitions, 18 changer transitions 4/66 dead transitions. [2021-03-25 04:30:23,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 482 flow [2021-03-25 04:30:23,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:30:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:30:23,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1262 transitions. [2021-03-25 04:30:23,313 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8504043126684636 [2021-03-25 04:30:23,313 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1262 transitions. [2021-03-25 04:30:23,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1262 transitions. [2021-03-25 04:30:23,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:23,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1262 transitions. [2021-03-25 04:30:23,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 180.28571428571428) internal successors, (1262), 7 states have internal predecessors, (1262), 0 states have call successors, (0), 0 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 04:30:23,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 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 04:30:23,321 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 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 04:30:23,321 INFO L185 Difference]: Start difference. First operand has 57 places, 53 transitions, 324 flow. Second operand 7 states and 1262 transitions. [2021-03-25 04:30:23,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 482 flow [2021-03-25 04:30:23,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 66 transitions, 478 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-03-25 04:30:23,327 INFO L241 Difference]: Finished difference. Result has 66 places, 62 transitions, 458 flow [2021-03-25 04:30:23,328 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=458, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2021-03-25 04:30:23,328 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2021-03-25 04:30:23,328 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:23,328 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 62 transitions, 458 flow [2021-03-25 04:30:23,328 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 62 transitions, 458 flow [2021-03-25 04:30:23,329 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 62 transitions, 458 flow [2021-03-25 04:30:23,420 INFO L129 PetriNetUnfolder]: 350/891 cut-off events. [2021-03-25 04:30:23,420 INFO L130 PetriNetUnfolder]: For 2028/2205 co-relation queries the response was YES. [2021-03-25 04:30:23,425 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 891 events. 350/891 cut-off events. For 2028/2205 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6385 event pairs, 26 based on Foata normal form. 3/854 useless extension candidates. Maximal degree in co-relation 3585. Up to 507 conditions per place. [2021-03-25 04:30:23,434 INFO L142 LiptonReduction]: Number of co-enabled transitions 1058 [2021-03-25 04:30:23,623 INFO L154 LiptonReduction]: Checked pairs total: 1706 [2021-03-25 04:30:23,623 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:30:23,623 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 295 [2021-03-25 04:30:23,624 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 448 flow [2021-03-25 04:30:23,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 0 states have call successors, (0), 0 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 04:30:23,624 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:23,624 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:23,624 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:30:23,624 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:23,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:23,625 INFO L82 PathProgramCache]: Analyzing trace with hash 597795087, now seen corresponding path program 1 times [2021-03-25 04:30:23,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:23,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039749773] [2021-03-25 04:30:23,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:30:23,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:23,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:30:23,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:23,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:30:23,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:23,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:23,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:23,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:23,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:23,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:23,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:23,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:23,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:23,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:23,811 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-25 04:30:23,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:30:23,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:23,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:30:23,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:30:23,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:30:23,825 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 04:30:23,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039749773] [2021-03-25 04:30:23,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:30:23,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 04:30:23,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102030110] [2021-03-25 04:30:23,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 04:30:23,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:30:23,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 04:30:23,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-03-25 04:30:23,827 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 212 [2021-03-25 04:30:23,829 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 448 flow. Second operand has 9 states, 9 states have (on average 152.22222222222223) internal successors, (1370), 9 states have internal predecessors, (1370), 0 states have call successors, (0), 0 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 04:30:23,829 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:30:23,829 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 212 [2021-03-25 04:30:23,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:30:24,551 INFO L129 PetriNetUnfolder]: 2240/3576 cut-off events. [2021-03-25 04:30:24,551 INFO L130 PetriNetUnfolder]: For 4734/4767 co-relation queries the response was YES. [2021-03-25 04:30:24,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11922 conditions, 3576 events. 2240/3576 cut-off events. For 4734/4767 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 22147 event pairs, 274 based on Foata normal form. 63/3320 useless extension candidates. Maximal degree in co-relation 11894. Up to 1362 conditions per place. [2021-03-25 04:30:24,578 INFO L132 encePairwiseOnDemand]: 204/212 looper letters, 35 selfloop transitions, 22 changer transitions 15/98 dead transitions. [2021-03-25 04:30:24,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 98 transitions, 702 flow [2021-03-25 04:30:24,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 04:30:24,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 04:30:24,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1422 transitions. [2021-03-25 04:30:24,582 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7452830188679245 [2021-03-25 04:30:24,582 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1422 transitions. [2021-03-25 04:30:24,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1422 transitions. [2021-03-25 04:30:24,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:30:24,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1422 transitions. [2021-03-25 04:30:24,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 158.0) internal successors, (1422), 9 states have internal predecessors, (1422), 0 states have call successors, (0), 0 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 04:30:24,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 212.0) internal successors, (2120), 10 states have internal predecessors, (2120), 0 states have call successors, (0), 0 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 04:30:24,590 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 212.0) internal successors, (2120), 10 states have internal predecessors, (2120), 0 states have call successors, (0), 0 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 04:30:24,591 INFO L185 Difference]: Start difference. First operand has 66 places, 61 transitions, 448 flow. Second operand 9 states and 1422 transitions. [2021-03-25 04:30:24,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 98 transitions, 702 flow [2021-03-25 04:30:24,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 98 transitions, 643 flow, removed 16 selfloop flow, removed 6 redundant places. [2021-03-25 04:30:24,736 INFO L241 Difference]: Finished difference. Result has 70 places, 57 transitions, 406 flow [2021-03-25 04:30:24,737 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=406, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2021-03-25 04:30:24,737 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2021-03-25 04:30:24,737 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:30:24,737 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 57 transitions, 406 flow [2021-03-25 04:30:24,737 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 57 transitions, 406 flow [2021-03-25 04:30:24,738 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 57 transitions, 406 flow [2021-03-25 04:30:24,821 INFO L129 PetriNetUnfolder]: 318/800 cut-off events. [2021-03-25 04:30:24,821 INFO L130 PetriNetUnfolder]: For 1405/1440 co-relation queries the response was YES. [2021-03-25 04:30:24,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2808 conditions, 800 events. 318/800 cut-off events. For 1405/1440 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5761 event pairs, 39 based on Foata normal form. 2/774 useless extension candidates. Maximal degree in co-relation 2781. Up to 219 conditions per place. [2021-03-25 04:30:24,833 INFO L142 LiptonReduction]: Number of co-enabled transitions 820 [2021-03-25 04:30:25,187 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-25 04:30:25,380 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-25 04:30:25,794 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-25 04:30:25,981 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-25 04:30:26,064 INFO L154 LiptonReduction]: Checked pairs total: 1361 [2021-03-25 04:30:26,064 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 04:30:26,064 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1327 [2021-03-25 04:30:26,065 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 392 flow [2021-03-25 04:30:26,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 152.22222222222223) internal successors, (1370), 9 states have internal predecessors, (1370), 0 states have call successors, (0), 0 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 04:30:26,065 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:30:26,065 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:30:26,066 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:30:26,066 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:30:26,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:30:26,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1439977964, now seen corresponding path program 1 times [2021-03-25 04:30:26,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:30:26,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723461208] [2021-03-25 04:30:26,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:30:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:30:26,118 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:30:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:30:26,166 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:30:26,196 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:30:26,197 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:30:26,197 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:30:26,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:30:26 BasicIcfg [2021-03-25 04:30:26,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:30:26,290 INFO L168 Benchmark]: Toolchain (without parser) took 14497.90 ms. Allocated memory was 255.9 MB in the beginning and 633.3 MB in the end (delta: 377.5 MB). Free memory was 234.7 MB in the beginning and 443.0 MB in the end (delta: -208.3 MB). Peak memory consumption was 169.0 MB. Max. memory is 16.0 GB. [2021-03-25 04:30:26,291 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:30:26,291 INFO L168 Benchmark]: CACSL2BoogieTranslator took 667.78 ms. Allocated memory was 255.9 MB in the beginning and 335.5 MB in the end (delta: 79.7 MB). Free memory was 234.1 MB in the beginning and 293.7 MB in the end (delta: -59.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-25 04:30:26,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.80 ms. Allocated memory is still 335.5 MB. Free memory was 293.0 MB in the beginning and 290.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:30:26,291 INFO L168 Benchmark]: Boogie Preprocessor took 51.98 ms. Allocated memory is still 335.5 MB. Free memory was 290.9 MB in the beginning and 288.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:30:26,292 INFO L168 Benchmark]: RCFGBuilder took 2069.18 ms. Allocated memory is still 335.5 MB. Free memory was 288.1 MB in the beginning and 242.2 MB in the end (delta: 45.9 MB). Peak memory consumption was 59.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:30:26,292 INFO L168 Benchmark]: TraceAbstraction took 11623.84 ms. Allocated memory was 335.5 MB in the beginning and 633.3 MB in the end (delta: 297.8 MB). Free memory was 242.2 MB in the beginning and 443.0 MB in the end (delta: -200.8 MB). Peak memory consumption was 97.0 MB. Max. memory is 16.0 GB. [2021-03-25 04:30:26,293 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.45 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 667.78 ms. Allocated memory was 255.9 MB in the beginning and 335.5 MB in the end (delta: 79.7 MB). Free memory was 234.1 MB in the beginning and 293.7 MB in the end (delta: -59.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 77.80 ms. Allocated memory is still 335.5 MB. Free memory was 293.0 MB in the beginning and 290.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 51.98 ms. Allocated memory is still 335.5 MB. Free memory was 290.9 MB in the beginning and 288.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2069.18 ms. Allocated memory is still 335.5 MB. Free memory was 288.1 MB in the beginning and 242.2 MB in the end (delta: 45.9 MB). Peak memory consumption was 59.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 11623.84 ms. Allocated memory was 335.5 MB in the beginning and 633.3 MB in the end (delta: 297.8 MB). Free memory was 242.2 MB in the beginning and 443.0 MB in the end (delta: -200.8 MB). Peak memory consumption was 97.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2791.2ms, 127 PlacesBefore, 62 PlacesAfterwards, 116 TransitionsBefore, 50 TransitionsAfterwards, 2886 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 5647 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2179, positive: 2057, positive conditional: 0, positive unconditional: 2057, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1324, positive: 1290, positive conditional: 0, positive unconditional: 1290, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1324, positive: 1290, positive conditional: 0, positive unconditional: 1290, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2179, positive: 767, positive conditional: 0, positive unconditional: 767, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 1324, unknown conditional: 0, unknown unconditional: 1324] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 724.0ms, 58 PlacesBefore, 46 PlacesAfterwards, 47 TransitionsBefore, 35 TransitionsAfterwards, 702 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 3042 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 651, positive: 519, positive conditional: 0, positive unconditional: 519, negative: 132, negative conditional: 0, negative unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 112, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 112, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 651, positive: 424, positive conditional: 0, positive unconditional: 424, negative: 115, negative conditional: 0, negative unconditional: 115, unknown: 112, unknown conditional: 0, unknown unconditional: 112] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 108, Positive conditional cache size: 0, Positive unconditional cache size: 108, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 587.7ms, 49 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 30 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1710 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 387, positive: 297, positive conditional: 0, positive unconditional: 297, negative: 90, negative conditional: 0, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 387, positive: 287, positive conditional: 0, positive unconditional: 287, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 118, Positive conditional cache size: 0, Positive unconditional cache size: 118, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 955.6ms, 43 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 442 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1036 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 183, positive: 129, positive conditional: 0, positive unconditional: 129, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 183, positive: 120, positive conditional: 0, positive unconditional: 120, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 93, Positive conditional cache size: 0, Positive unconditional cache size: 93, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.3ms, 46 PlacesBefore, 44 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 457 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 84, positive: 63, positive conditional: 0, positive unconditional: 63, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 84, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 98, Positive conditional cache size: 0, Positive unconditional cache size: 98, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 425.1ms, 50 PlacesBefore, 50 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 736 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 268 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, positive: 20, positive conditional: 0, positive unconditional: 20, 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: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 29, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 428.3ms, 58 PlacesBefore, 58 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 1058 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1197 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 149, positive: 117, positive conditional: 0, positive unconditional: 117, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 149, positive: 109, positive conditional: 0, positive unconditional: 109, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 260.1ms, 57 PlacesBefore, 57 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 910 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 551 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 53, positive: 37, positive conditional: 0, positive unconditional: 37, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 53, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 101, Positive conditional cache size: 0, Positive unconditional cache size: 101, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 294.9ms, 66 PlacesBefore, 66 PlacesAfterwards, 62 TransitionsBefore, 61 TransitionsAfterwards, 1058 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1706 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 218, positive: 174, positive conditional: 0, positive unconditional: 174, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 218, positive: 157, positive conditional: 0, positive unconditional: 157, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 105, Positive conditional cache size: 0, Positive unconditional cache size: 105, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1327.0ms, 70 PlacesBefore, 66 PlacesAfterwards, 57 TransitionsBefore, 54 TransitionsAfterwards, 820 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 1361 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 267, positive: 225, positive conditional: 0, positive unconditional: 225, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 267, positive: 205, positive conditional: 0, positive unconditional: 205, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t201; [L872] FCALL, FORK 0 pthread_create(&t201, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t202; [L874] FCALL, FORK 0 pthread_create(&t202, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t203; [L876] FCALL, FORK 0 pthread_create(&t203, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0: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=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0: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=1, y=2, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0: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=1, y=2, z=0] [L877] 0 pthread_t t204; [L878] FCALL, FORK 0 pthread_create(&t204, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=1, y=2, z=0] [L827] 4 z = 1 [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=0, x=1, y=2, z=1] [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=49, weak$$choice2=0, x=1, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 11367.1ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2108.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2887.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 68 SDtfs, 52 SDslu, 58 SDs, 0 SdLazy, 238 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 234.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 142.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=458occurred in iteration=8, InterpolantAutomatonStates: 47, 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: 36.5ms SsaConstructionTime, 427.9ms SatisfiabilityAnalysisTime, 591.7ms InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 675 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...